Compressing branch-and-bound trees

DOI10.1007/978-3-031-32726-1_25zbMath1528.90155arXiv2211.02727MaRDI QIDQ6086013

Joseph Paat, Gonzalo Muñoz, Álinson S. Xavier

Publication date: 9 November 2023

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Achieving MILP feasibility quickly using general disjunctions
• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
• Branching on general disjunctions
• Improved strategies for branching on general disjunctions
• Branching rules revisited
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
• On the complexity of finding shortest variable disjunction branch-and-bound proofs
• Verifying integer programming results
• Lower bounds on the size of general branch-and-bound trees
• On the Complexity of Selecting Disjunctions in Integer Programming
• Solving Real-World Linear Programs: A Decade and More of Progress
• Hard Knapsack Problems
• A Computational Study of Search Strategies for Mixed Integer Programming
• Trivial integer programs unsolvable by branch-and-bound
• Multivariable Branching: A 0-1 Knapsack Problem Case Study
• MathOptInterface: A Data Structure for Mathematical Optimization Problems
• Sparsity of Lift-and-Project Cutting Planes
• Hard Equality Constrained Integer Knapsacks
• JuMP: A Modeling Language for Mathematical Optimization
• Branching on Multi-aggregated Variables
• Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming

This page was built for publication: Compressing branch-and-bound trees