Branch-and-cut methods are among the most important techniques for solving integer
programming problems. They can also be used to prove that all solutions of an integer
program satisfy a given linear inequality. We examine the complexity of branch-and-cut
proofs in the context of 0-1 integer programs. We prove an exponential lower bound on the length of branch-and-cut proofs which use 0-1 branching and lift-and-project cuts (called simple disjunctive cuts by some authors), Gomory-Chvatal cuts, and cuts arising from the N0 matrix-cut operator of Lovasz and Schrijver. A consequence of the lower-bound result in this paper is that branch-and-cut methods of the type described above have exponential running time in the worst case.
By: Sanjeeb Dash
Published in: RC22575 in 2002
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .