Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
From MaRDI portal
Recommendations
- Lifted flow cover inequalities for mixed 0-1 integer programs
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- scientific article; zbMATH DE number 2086920
- Simple lifted cover inequalities and hard knapsack problems
- On combinatorial approximation of covering 0-1 integer programs and partial set cover
- An approximation algorithm for the partial covering 0-1 integer program
- An improved approximation algorithm for the covering 0-1 integer program
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- The complexity of lifted inequalities for the knapsack problem
Cited in
(35)- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
- Sequence independent lifting of cover inequalities
- A new class of hard problem instances for the 0-1 knapsack problem
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts
- New classes of facets for complementarity knapsack problems
- Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
- Knapsack polytopes: a survey
- New classes of facets for complementarity knapsack problems
- Simple lifted cover inequalities and hard knapsack problems
- On the complexity of separating cutting planes for the knapsack polytope
- On the minimum cost multiple-source unsplittable flow problem
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope
- Scheduling of waterways with tide and passing box
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- On the complexity of separation from the knapsack polytope
- A branch-cut-and-price algorithm for the piecewise linear transportation problem
- Cover and pack inequalities for (mixed) integer programming
- scientific article; zbMATH DE number 2086919 (Why is no real title available?)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
- Optimal network design with end-to-end service requirements
- Separation algorithms for 0-1 knapsack polytopes
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- Valid inequalities for the -edge disruptor problem
- Risk-averse shortest path interdiction
- Yet harder knapsack problems
- An effective hybrid approach to the two-stage capacitated facility location problem
- Two-set inequalities for the binary knapsack polyhedra
- Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
- Chance-Constrained Binary Packing Problems
- Cover-based inequalities for the single-source capacitated facility location problem with customer preferences
This page was built for publication: Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427368)
