Branching on general disjunctions
From MaRDI portal
Publication:543420
DOI10.1007/s10107-009-0332-3zbMath1218.90128OpenAlexW2150008491MaRDI QIDQ543420
Miroslav Karamanov, Cornuéjols, Gérard
Publication date: 17 June 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-0332-3
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Computing deep facet-defining disjunctive cuts for mixed-integer programming, 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, A study of lattice reformulations for integer programming, Compressing branch-and-bound trees, Constraint Orbital Branching, Improved strategies for branching on general disjunctions, Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices, Information-based branching schemes for binary linear mixed integer problems, Unnamed Item, A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management, Improving strong branching by domain propagation, Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
Uses Software
Cites Work
- Unnamed Item
- Improved strategies for branching on general disjunctions
- Chvátal closures for mixed integer programming problems
- Factoring polynomials with rational coefficients
- Local branching
- Branching rules revisited
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
- Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study
- Integer Programming with a Fixed Number of Variables
- Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts
- Integer Programming and Pricing
- Aggregation and Mixed Integer Rounding to Solve MIPs
- The Generalized Basis Reduction Algorithm
- 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
- A Computational Study of Search Strategies for Mixed Integer Programming
- 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
