Improved strategies for branching on general disjunctions
From MaRDI portal
Publication:652284
DOI10.1007/s10107-009-0333-2zbMath1229.90104OpenAlexW2070788858MaRDI QIDQ652284
Leo Liberti, Cornuéjols, Gérard, Giacomo Nannicini
Publication date: 14 December 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0333-2
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Improved branching disjunctions for branch-and-bound: an analytic center approach, Achieving MILP feasibility quickly using general disjunctions, An abstract model for branch-and-cut, Practical strategies for generating rank-1 split cuts in mixed-integer linear programming, Compressing branch-and-bound trees, Lower bounds on the size of general branch-and-bound trees, Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices, Branching on general disjunctions, Information-based branching schemes for binary linear mixed integer problems, A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management, Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Branching on general disjunctions
- Optimizing over the split closure
- Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts
- Disjunctive Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
