The complexity of cover inequality separation
From MaRDI portal
Publication:1306471
DOI10.1016/S0167-6377(98)00025-XzbMATH Open0957.90094WikidataQ127845863 ScholiaQ127845863MaRDI QIDQ1306471FDOQ1306471
Authors: Diego Klabjan, G. L. Nemhauser, Craig A. Tovey 
Publication date: 2 April 2001
Published in: Operations Research Letters (Search for Journal in Brave)
Recommendations
Cites Work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving Multiple Knapsack Problems by Cutting Planes
- Title not available (Why is that?)
Cited In (28)
- On inequalities with bounded coefficients and pitch for the min knapsack polytope
- Implicit cover inequalities
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
- New classes of facets for complementarity knapsack problems
- On the exact separation of cover inequalities of maximum-depth
- Knapsack polytopes: a survey
- New classes of facets for complementarity knapsack problems
- Primal separation algorithms
- Simple lifted cover inequalities and hard knapsack problems
- On the complexity of separating cutting planes for the knapsack polytope
- On the separation of split cuts and related inequalities
- \(O(n \log n)\) procedures for tightening cover inequalities
- On the complexity of the separation problem for rounded capacity inequalities
- Cutting planes for the multistage stochastic unit commitment problem
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope
- Sparsity of integer formulations for binary programs
- On the complexity of separation from the knapsack polytope
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- Separation algorithms for 0-1 knapsack polytopes
- Optimization algorithms for the disjunctively constrained knapsack problem
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Pitch, extension complexity, and covering problems
- Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
- Strengthening convex relaxations of 0/1-sets using Boolean formulas
- Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem
- Packing, partitioning, and covering symresacks
- Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
This page was built for publication: The complexity of cover inequality separation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306471)
