On the complexity of selecting disjunctions in integer programming
From MaRDI portal
Publication:3083283
DOI10.1137/080737587zbMATH Open1211.90136OpenAlexW2158102350MaRDI QIDQ3083283FDOQ3083283
Authors: Ashutosh Mahajan, Ted K. Ralphs 
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080737587
Recommendations
- Branching on split disjunctions
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- On the separation of split cuts and related inequalities
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube
- Improved strategies for branching on general disjunctions
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)
Cited In (12)
- Thinner is not always better: cascade knapsack problems
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
- Could we use a million cores to solve an integer program?
- Compressing branch-and-bound trees
- An incremental algorithm for computing ranked full disjunctions
- Improved branching disjunctions for branch-and-bound: an analytic center approach
- Achieving MILP feasibility quickly using general disjunctions
- When the Gomory-chvátal closure coincides with the integer hull
- A unified framework for multistage mixed integer linear optimization
- Deciding emptiness of the Gomory-Chvátal closure is NP-complete, even for a rational polyhedron containing no integer point
- On the rational polytopes with Chvátal rank 1
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube
This page was built for publication: On the complexity of selecting disjunctions in integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083283)
