On the power and limitations of branch and cut

The Stabbing Planes proof system [8] was introduced to model the reasoning carried out in practical mixed integer programming solvers. As a proof system, it is powerful enough to simulate Cutting Planes and to refute the Tseitin formulas - certain unsatisfiable systems of linear equations mod2 - which are canonical hard examples for many algebraic proof systems. In a recent (and surprising) result, Dadush and Tiwari [25] showed that these short refutations of the Tseitin formulas could be translated into quasi-polynomial size and depth Cutting Planes proofs, refuting a long-standing conjecture. This translation raises several interesting questions. First, whether all Stabbing Planes proofs can be efficiently simulated by Cutting Planes. This would allow for the substantial analysis done on the Cutting Planes system to be lifted to practical mixed integer programming solvers. Second, whether the quasi-polynomial depth of these proofs is inherent to Cutting Planes. In this paper we make progress towards answering both of these questions. First, we show that any Stabbing Planes proof with bounded coefficients (SP*) can be translated into Cutting Planes. As a consequence of the known lower bounds for Cutting Planes, this establishes the first exponential lower bounds on SP*. Using this translation, we extend the result of Dadush and Tiwari to show that Cutting Planes has short refutations of any unsatisfiable system of linear equations over a finite field. Like the Cutting Planes proofs of Dadush and Tiwari, our refutations also incur a quasi-polynomial blow-up in depth, and we conjecture that this is inherent. As a step towards this conjecture, we develop a new geometric technique for proving lower bounds on the depth of Cutting Planes proofs. This allows us to establish the first lower bounds on the depth of Semantic Cutting Planes proofs of the Tseitin formulas.

[1]  Endre Szemerédi,et al.  Many hard examples for resolution , 1988, JACM.

[2]  Russell Impagliazzo,et al.  Stabbing Planes , 2017, ITCS.

[3]  S. Thomas McCormick,et al.  Integer Programming and Combinatorial Optimization , 1996, Lecture Notes in Computer Science.

[4]  William J. Cook,et al.  On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..

[5]  Toniann Pitassi,et al.  Automating cutting planes is NP-hard , 2020, Electron. Colloquium Comput. Complex..

[6]  Sanjay Mehrotra,et al.  Experimental Results on Using General Disjunctions in Branch-and-Bound for General-Integer Linear Programs , 2001, Comput. Optim. Appl..

[7]  Friedrich Eisenbrand,et al.  Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube , 1999, IPCO.

[8]  Maria Luisa Bonet,et al.  Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution , 2002, Inf. Comput..

[9]  Adnan Darwiche,et al.  Recursive conditioning , 2001, Artif. Intell..

[10]  Friedrich Eisenbrand,et al.  Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube* , 2003, Comb..

[11]  Russell Impagliazzo,et al.  Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space , 2012, STOC '12.

[12]  Grant Schoenebeck,et al.  Linear Level Lasserre Lower Bounds for Certain k-CSPs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[13]  C. Burdet,et al.  On cutting planes , 1973 .

[14]  Friedrich Eisenbrand,et al.  On the Chvátal Rank of Polytopes in the 0/1 Cube , 1999, Discret. Appl. Math..

[15]  William J. Cook,et al.  On cutting-plane proofs in combinatorial optimization , 1989 .

[16]  Christoph Berkholz,et al.  Supercritical Space-Width Trade-offs for Resolution , 2016, Electron. Colloquium Comput. Complex..

[17]  Toniann Pitassi,et al.  Rank Bounds and Integrality Gaps for Cutting Planes Procedures , 2006, Theory Comput..

[18]  Yuval Filmus,et al.  Semantic Versus Syntactic Cutting Planes , 2016, STACS.

[19]  Pavel Pudlák,et al.  Random Formulas, Monotone Circuits, and Interpolation , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[20]  Stefan Szeider,et al.  A SAT Approach to Branchwidth , 2017, IJCAI.

[21]  Toniann Pitassi,et al.  Random Θ(log n)-CNFs Are Hard for Cutting Planes , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[22]  Marco Di Summa,et al.  Complexity of branch-and-bound and cutting planes in mixed-integer optimization - II , 2021, IPCO.

[23]  Chris Beck,et al.  Some trade-off results for polynomial calculus: extended abstract , 2013, STOC '13.

[24]  Sebastian Pokutta,et al.  Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank , 2011, Oper. Res. Lett..

[25]  Ran Raz,et al.  Lower bounds for cutting planes proofs with small coefficients , 1995, STOC '95.

[26]  Daniel Dadush,et al.  On the complexity of branching proofs , 2020, CCC.

[27]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[28]  Arjen K. Lenstra,et al.  Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances , 1999, INFORMS J. Comput..

[29]  Sebastian Pokutta,et al.  Aggregation-based cutting-planes for packing and covering integer programs , 2018, Math. Program..

[30]  Alexander A. Razborov On the Width of Semi-Algebraic Proofs and Algorithms , 2016, Electron. Colloquium Comput. Complex..

[31]  Gérard Cornuéjols,et al.  Branching on general disjunctions , 2011, Math. Program..

[32]  Eli Ben-Sasson,et al.  Short proofs are narrow—resolution made simple , 2001, JACM.

[33]  Discretely Ordered Modules as a First-Order Extension of The Cutting Planes Proof System , 1998, J. Symb. Log..

[34]  Dima Grigoriev,et al.  Tseitin's tautologies and lower bounds for Nullstellensatz proofs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[35]  Pavel Pudlák,et al.  Lower bounds for resolution and cutting plane proofs and monotone computations , 1997, Journal of Symbolic Logic.

[36]  Stephen A. Cook,et al.  The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[37]  Joao Marques-Silva,et al.  GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[38]  Michael Alekhnovich,et al.  Satisfiability, Branch-Width and Tseitin tautologies , 2011, computational complexity.

[39]  Dima Grigoriev,et al.  Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity , 2001, Theor. Comput. Sci..

[40]  David P. Williamson,et al.  .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.

[41]  Sebastian Pokutta,et al.  On the Rank of Cutting-Plane Proof Systems , 2010, IPCO.

[42]  Nikhil Srivastava,et al.  Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[43]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[44]  Arist Kojevnikov Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities , 2007, SAT.

[45]  Russell Impagliazzo,et al.  Upper and lower bounds for tree-like cutting planes proofs , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[46]  Narrow Proofs May Be Maximally Long , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).

[47]  Samuel R. Buss,et al.  Linear gaps between degrees for the polynomial calculus modulo distinct primes , 1999, STOC '99.

[48]  Gérard Cornuéjols,et al.  On the Rank of Mixed 0, 1 Polyhedra , 2001, IPCO.

[49]  Rina Dechter Bucket elimination: a unifying framework for processing hard and soft constraints , 1996, CSUR.

[50]  Laura Sanità,et al.  0/1 Polytopes with Quadratic Chvátal Rank , 2017, Oper. Res..

[51]  Yuan Zhou,et al.  Hypercontractivity, sum-of-squares proofs, and their applications , 2012, STOC '12.

[52]  Pavel Pudlák Proofs as Games , 2000, Am. Math. Mon..

[53]  P. Parrilo Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .

[54]  A. Mahajan,et al.  Experiments with Branching using General Disjunctions , 2009 .

[55]  Maria Luisa Bonet,et al.  Optimality of size-width tradeoffs for resolution , 2001, computational complexity.

[56]  Gábor Pataki,et al.  Column basis reduction and decomposable knapsack problems , 2008, Discret. Optim..

[57]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[58]  Arjen K. Lenstra,et al.  Hard Equality Constrained Integer Knapsacks , 2002, Math. Oper. Res..

[59]  Alexander A. Razborov,et al.  A New Kind of Tradeoffs in Propositional Proof Complexity , 2016, J. ACM.

[60]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[61]  Ankit Garg,et al.  Monotone circuit lower bounds from resolution , 2018, Electron. Colloquium Comput. Complex..