On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs

Max Gläser, Marc E. Pfetsch. On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs. In Karen Aardal, Laura Sanità, editors, Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings. Volume 13265 of Lecture Notes in Computer Science, pages 291-304, Springer, 2022. [doi]

Abstract

Abstract is missing.