New classes of facets for complementarity knapsack problems
From MaRDI portal
Publication:6166884
DOI10.1007/978-3-031-18530-4_1zbMath1528.90212arXiv2203.02873OpenAlexW4221155956MaRDI QIDQ6166884
Alberto Del Pia, Haoran Zhu, Jeff Linderoth
Publication date: 3 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.02873
Cites Work
- Branch-and-cut for complementarity-constrained optimization
- Cover and pack inequalities for (mixed) integer programming
- Knapsack polytopes: a survey
- An algorithm for disjunctive programs
- The complexity of cover inequality separation
- On the \(0/1\) knapsack polytope
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- Sequence independent lifting in mixed integer programming
- Multi-cover inequalities for totally-ordered multiple knapsack sets
- On the complexity of separation from the knapsack polytope
- A polyhedral study of the semi-continuous knapsack problem
- Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- Solving Large-Scale Zero-One Linear Programming Problems
- (1,k)-configurations and facets for packing problems
- Faces for a linear inequality in 0–1 variables
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- Reducibility among Combinatorial Problems
- Facets of the Complementarity Knapsack Polytope
