Multi-cover inequalities for totally-ordered multiple knapsack sets
From MaRDI portal
Publication:2061876
DOI10.1007/978-3-030-73879-2_14zbMath1482.90180arXiv2106.00301OpenAlexW3165665341MaRDI QIDQ2061876
Haoran Zhu, Jeff Linderoth, Alberto Del Pia
Publication date: 21 December 2021
Full work available at URL: https://arxiv.org/abs/2106.00301
Related Items
On the complexity of separation from the knapsack polytope, New classes of facets for complementarity knapsack problems, Multi-cover inequalities for totally-ordered multiple knapsack sets
Cites Work
- On the exact separation of mixed integer knapsack cuts
- Knapsack polytopes: a survey
- On the \(0/1\) knapsack polytope
- Aggregation-based cutting-planes for packing and covering integer programs
- Multi-cover inequalities for totally-ordered multiple knapsack sets
- On lifted cover inequalities: a new lifting procedure with unusual properties
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Solving Large-Scale Zero-One Linear Programming Problems
- (1,k)-configurations and facets for packing problems
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- The Scenario Approach to Robust Control Design
