Sciweavers

6 search results - page 1 / 2
» Integer Programming with 2-Variable Equations and 1-Variable...
Sort
View
COLOGNETWENTE
2009
13 years 6 months ago
Integer Programming with 2-Variable Equations and 1-Variable Inequalities
We present an efficient algorithm to find an optimal integer solution of a given system of 2-variable equalities and 1-variable inequalities with respect to a given linear objectiv...
Manuel Bodirsky, Gustav Nordh, Timo von Oertzen
MP
2011
12 years 12 months ago
On the relative strength of split, triangle and quadrilateral cuts
Integer programs defined by two equations with two free integer variables and nonnegative continuous variables have three types of nontrivial facets: split, triangle or quadrilat...
Amitabh Basu, Pierre Bonami, Gérard Cornu&e...
DISOPT
2011
175views Education» more  DISOPT 2011»
12 years 8 months ago
Strengthening lattice-free cuts using non-negativity
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
Ricardo Fukasawa, Oktay Günlük
CADE
2007
Springer
14 years 5 months ago
A Sequent Calculus for Integer Arithmetic with Counterexample Generation
We introduce a calculus for handling integer arithmetic in first-order logic. The method is tailored to Java program verification and meant to be used both as a supporting procedur...
Philipp Rümmer
ORL
2008
111views more  ORL 2008»
13 years 5 months ago
Certificates of linear mixed integer infeasibility
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...
Kent Andersen, Quentin Louveaux, Robert Weismantel