A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
From MaRDI portal
Publication:429688
DOI10.1016/j.disopt.2010.09.005zbMath1241.90128OpenAlexW2064267171MaRDI QIDQ429688
Jean-Philippe P. Richard, Bo Zeng
Publication date: 20 June 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2010.09.005
Related Items
Knapsack polytopes: a survey, Cover by disjoint cliques cuts for the knapsack problem with conflicting items, A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, A polyhedral study on 0-1 knapsack problems with set packing constraints, Optimization algorithms for the disjunctively constrained knapsack problem, Lifting convex inequalities for bipartite bilinear programs, Lifting convex inequalities for bipartite bilinear programs, On cutting planes for cardinality-constrained linear programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
- Second-order cover inequalities
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
- A note on the knapsack problem with special ordered sets
- A capacity allocation problem with integer side constraints
- Scheduling problems in a practical allocation model
- On the \(0/1\) knapsack polytope
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- Sequence independent lifting in mixed integer programming
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- Easily Computable Facets of the Knapsack Polytope
- A computational study of a multiple-choice knapsack algorithm
- Lifting the facets of zero–one polytopes
- (1,k)-configurations and facets for packing problems
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- The Multiple-Choice Knapsack Problem
- Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
- Solving Multiple Knapsack Problems by Cutting Planes
