Colloque avec actes et comité de lecture. internationale.International audienceCutting planes were introduced in 1958 by Gomory in order to solve integer linear optimization problems. Since then, they have received a lot of interest, not only in mathematical optimization, but also in logic and complexity theory. In this paper, we present some recent results on cutting planes at the interface of logic and optimization. Main emphasis is on the length and the rank of cutting plane proofs based on the Gomory-Chvátal rounding principle
Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on ...
We consider a new finitely convergent cutting plane algorithm for mixed integer linear programs in w...
AbstractAs introduced by Chvátal, cutting planes provide a canonical way of proving that every integ...
SIGLETIB Hannover: RN 4052(87452-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische I...
AbstractGomory's cutting-plane technique can be viewed as a recursive procedure for proving the vali...
In this thesis, we study theoretical aspects of integer linear programming. This thesis consists of...
Cutting plane algorithms have turned out to be practically successful computational tools in combina...
In chapter 26 of his book, George Dantzig presented side by side (i) a number of difficult mathemati...
w9255960 Integer programming (IP) problems are difficult to solve due to the integer restrictions im...
Cutting plane algorithms have turned out to be practically successful computational tools in combina...
In this paper, we introduce a new cutting plane algorithm which is computationally less expensive an...
The cutting plane approach to finding minimum-cost perfect matchings has been discussed by several a...
The cutting plane approach to finding minimum-cost perfect matchings has been discussed by several a...
In this paper, we introduce a new cutting plane algorithm which is computationally less expensive an...
A cutting-plane procedure for integer programming (IP) problems usually involves invoking a black-bo...
Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on ...
We consider a new finitely convergent cutting plane algorithm for mixed integer linear programs in w...
AbstractAs introduced by Chvátal, cutting planes provide a canonical way of proving that every integ...
SIGLETIB Hannover: RN 4052(87452-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische I...
AbstractGomory's cutting-plane technique can be viewed as a recursive procedure for proving the vali...
In this thesis, we study theoretical aspects of integer linear programming. This thesis consists of...
Cutting plane algorithms have turned out to be practically successful computational tools in combina...
In chapter 26 of his book, George Dantzig presented side by side (i) a number of difficult mathemati...
w9255960 Integer programming (IP) problems are difficult to solve due to the integer restrictions im...
Cutting plane algorithms have turned out to be practically successful computational tools in combina...
In this paper, we introduce a new cutting plane algorithm which is computationally less expensive an...
The cutting plane approach to finding minimum-cost perfect matchings has been discussed by several a...
The cutting plane approach to finding minimum-cost perfect matchings has been discussed by several a...
In this paper, we introduce a new cutting plane algorithm which is computationally less expensive an...
A cutting-plane procedure for integer programming (IP) problems usually involves invoking a black-bo...
Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on ...
We consider a new finitely convergent cutting plane algorithm for mixed integer linear programs in w...
AbstractAs introduced by Chvátal, cutting planes provide a canonical way of proving that every integ...