Compressing branch-and-bound trees
From MaRDI portal
Cites work
- A Computational Study of Search Strategies for Mixed Integer Programming
- Achieving MILP feasibility quickly using general disjunctions
- Branching on general disjunctions
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
- Branching on multi-aggregated variables
- Branching rules revisited
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Compressing branch-and-bound trees
- Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
- Hard Equality Constrained Integer Knapsacks
- Hard Knapsack Problems
- scientific article; zbMATH DE number 7561762 (Why is no real title available?)
- Improved strategies for branching on general disjunctions
- JuMP: a modeling language for mathematical optimization
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Multivariable Branching: A 0-1 Knapsack Problem Case Study
- On the complexity of finding shortest variable disjunction branch-and-bound proofs
- On the complexity of selecting disjunctions in integer programming
- Stabbing planes
- The integrality number of an integer program
- Trivial integer programs unsolvable by branch-and-bound
- Verifying integer programming results
This page was built for publication: Compressing branch-and-bound trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7019057)
