Sciweavers

7 search results - page 1 / 2
» An Implementation of the Barvinok--Woods Integer Projection ...
Sort
View
ITSL
2008
13 years 6 months ago
An Implementation of the Barvinok--Woods Integer Projection Algorithm
We describe the first implementation of the Barvinok
Matthias Koeppe, Sven Verdoolaege, Kevin Woods
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
13 years 11 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
CADE
2012
Springer
11 years 7 months ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...
DISOPT
2008
138views more  DISOPT 2008»
13 years 4 months ago
An algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, ...
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 4 months ago
Solving Sparse Integer Linear Systems
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a p-adic lifting technique combined with the use of block matr...
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne...