We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs in the plane. We also prove that the split closure of a polyhedron in the plane has polynomial size
AbstractThis paper is a survey, with new results, of the algebraic approach to cutting-planes. The n...
Recently, cutting planes derived from maximal lattice-free convex sets have been stud-ied intensivel...
The split cuts of Cook, Kannan and Schrijver are general-purpose valid inequalities for integer prog...
The elementary closure $P'$ of a polyhedron $P$ is the intersection of $P$ with all its Gomory-Chvát...
The set obtained by adding all cuts whose validity follows from a maximal lattice free polyhedron wi...
This paper gives an introduction to a recently established link between the geometry of numbers and ...
We study a mixed integer linear program with m integer variables and k non-negative continu...
We analyze the properties of an interior point cutting plane algorithm that is based on a semi-infin...
Let $${P \subseteq {\mathbb R}^{m+n}}$$ be a rational polyhedron, and let P I be the convex hull of ...
We consider the question of finding deep cuts from a model with two rows of the type PI = {(x,s) ∈ Z...
We study a mixed integer linear program with m integer variables and k non-negative continuous varia...
The cutting plane approach to finding minimum-cost perfect matchings has been discussed by several a...
AbstractGomory's cutting-plane technique can be viewed as a recursive procedure for proving the vali...
Numéro du rapport MPI-I-1999-2-008. Rapport interne.The elementary closure $P'$ of a polyhedron $P$ ...
In this note, we present a simple geometric argument to determine a lower bound on the split rank of...
AbstractThis paper is a survey, with new results, of the algebraic approach to cutting-planes. The n...
Recently, cutting planes derived from maximal lattice-free convex sets have been stud-ied intensivel...
The split cuts of Cook, Kannan and Schrijver are general-purpose valid inequalities for integer prog...
The elementary closure $P'$ of a polyhedron $P$ is the intersection of $P$ with all its Gomory-Chvát...
The set obtained by adding all cuts whose validity follows from a maximal lattice free polyhedron wi...
This paper gives an introduction to a recently established link between the geometry of numbers and ...
We study a mixed integer linear program with m integer variables and k non-negative continu...
We analyze the properties of an interior point cutting plane algorithm that is based on a semi-infin...
Let $${P \subseteq {\mathbb R}^{m+n}}$$ be a rational polyhedron, and let P I be the convex hull of ...
We consider the question of finding deep cuts from a model with two rows of the type PI = {(x,s) ∈ Z...
We study a mixed integer linear program with m integer variables and k non-negative continuous varia...
The cutting plane approach to finding minimum-cost perfect matchings has been discussed by several a...
AbstractGomory's cutting-plane technique can be viewed as a recursive procedure for proving the vali...
Numéro du rapport MPI-I-1999-2-008. Rapport interne.The elementary closure $P'$ of a polyhedron $P$ ...
In this note, we present a simple geometric argument to determine a lower bound on the split rank of...
AbstractThis paper is a survey, with new results, of the algebraic approach to cutting-planes. The n...
Recently, cutting planes derived from maximal lattice-free convex sets have been stud-ied intensivel...
The split cuts of Cook, Kannan and Schrijver are general-purpose valid inequalities for integer prog...
DOI
Add to ORKG