Lower bounds on the size of general branch-and-bound trees

DOI10.1007/s10107-022-01781-zOpenAlexW4210891215MaRDI QIDQ2687056

Yatharth Dubey, Marco Molinaro, Santanu S. Dey

Publication date: 1 March 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items (3)

An abstract model for branch-and-cut ⋮ Compressing branch-and-bound trees ⋮ Complexity of optimizing over the integers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• VC bounds on the cardinality of nearly orthogonal function classes
• Improved strategies for branching on general disjunctions
• On cutting-plane proofs in combinatorial optimization
• Factoring polynomials with rational coefficients
• On the relative strength of different generalizations of split cuts
• On the Matrix-Cut Rank of Polyhedra
• Integer Programming with a Fixed Number of Variables
• Integer Programming
• An Automatic Method of Solving Discrete Programming Problems
• Hard Knapsack Problems
• Lower bounds for resolution and cutting plane proofs and monotone computations
• Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
• High-Dimensional Probability
• Trivial integer programs unsolvable by branch-and-bound
• Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
• On the power and limitations of branch and cut

This page was built for publication: Lower bounds on the size of general branch-and-bound trees