AbstractThis paper is a survey, with new results, of the algebraic approach to cutting-planes. The new results are a subadditive dual program for integer programs, and a generalization of R. Gomory's linear inequality characterization of the cuts valid for the group problem. We also provide some results on the large family of alternate group problems, in addition to the one group problem that is conventionally thought of in connection with the algebraic approach. In terms of expository material, we shall provide very concise proofs of the most well-known results in the basic papers of the algebraic approach. (Note: This is a revision of Part I of MSRR no. 370)
This survey presents cutting planes that are useful or potentially useful in solving mixed integer p...
Cut-generating functions are tools for producing cutting planes for generic mixed-integer sets. Hist...
My work focuses on cutting planes technology in Mixed Integer Programming. I explore novel classes o...
Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on ...
We study quantitative criteria for evaluating the strength of valid inequalities for Gomory and John...
This dissertation is devoted to solving general mixed integer optimization problems. Our main focus ...
In this thesis, we develop efficient methods to generate cutting planes for unstructured mixed integ...
In chapter 26 of his book, George Dantzig presented side by side (i) a number of difficult mathemati...
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...
Cutting planes for mixed-integer linear programs (MILPs) are typically computed in rounds by iterati...
w9255960 Integer programming (IP) problems are difficult to solve due to the integer restrictions im...
In this thesis, we study theoretical aspects of integer linear programming. This thesis consists of...
We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs i...
This survey presents cutting planes that are useful or potentially useful in solving mixed integer p...
This survey presents cutting planes that are useful or potentially useful in solving mixed integer p...
Cut-generating functions are tools for producing cutting planes for generic mixed-integer sets. Hist...
My work focuses on cutting planes technology in Mixed Integer Programming. I explore novel classes o...
Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on ...
We study quantitative criteria for evaluating the strength of valid inequalities for Gomory and John...
This dissertation is devoted to solving general mixed integer optimization problems. Our main focus ...
In this thesis, we develop efficient methods to generate cutting planes for unstructured mixed integ...
In chapter 26 of his book, George Dantzig presented side by side (i) a number of difficult mathemati...
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...
Cutting planes for mixed-integer linear programs (MILPs) are typically computed in rounds by iterati...
w9255960 Integer programming (IP) problems are difficult to solve due to the integer restrictions im...
In this thesis, we study theoretical aspects of integer linear programming. This thesis consists of...
We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs i...
This survey presents cutting planes that are useful or potentially useful in solving mixed integer p...
This survey presents cutting planes that are useful or potentially useful in solving mixed integer p...
Cut-generating functions are tools for producing cutting planes for generic mixed-integer sets. Hist...
My work focuses on cutting planes technology in Mixed Integer Programming. I explore novel classes o...