On the power and limitations of branch and cut

DOI10.4230/lipics.ccc.2021.6arXiv2102.05019OpenAlexW3134484519MaRDI QIDQ6115357

Mika Göös, Avi Wigderson, Li-Yang Tan, Russell Impagliazzo, Toniann Pitassi, Noah Fleming, Robert Robere

Publication date: 12 July 2023

Full work available at URL: https://arxiv.org/abs/2102.05019

zbMATH Keywords

integer programmingbranch and cutcutting planesproof complexitystabbing planes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (6)

On polytopes with linear rank with respect to generalizations of the split closure ⋮ Depth lower bounds in Stabbing Planes for combinatorial principles ⋮ Complexity of optimizing over the integers ⋮ Lower bounds on the size of general branch-and-bound trees ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization ⋮ Reflections on Proof Complexity and Counting Principles

This page was built for publication: On the power and limitations of branch and cut