Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
From MaRDI portal
Recommendations
Cited in
(18)- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Information-based branching schemes for binary linear mixed integer problems
- Improving strong branching by domain propagation
- A two-stage stochastic integer programming approach to integrated staffing and scheduling with application to nurse management
- Branching on split disjunctions
- Improved branching disjunctions for branch-and-bound: an analytic center approach
- Achieving MILP feasibility quickly using general disjunctions
- Information-theoretic approaches to branching in search
- scientific article; zbMATH DE number 7561762 (Why is no real title available?)
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
- Branching on general disjunctions
- A study of lattice reformulations for integer programming
- Compressing branch-and-bound trees
- Improved strategies for branching on general disjunctions
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Compressing branch-and-bound trees
- On the power and limitations of branch and cut
- Branching with a pre-specified finite list of k-sparse split sets for binary MIPs
This page was built for publication: Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5947148)
