A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
From MaRDI portal
Publication:429687
DOI10.1016/j.disopt.2010.09.004zbMath1241.90127OpenAlexW1973223260MaRDI QIDQ429687
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.004
Related Items (11)
Knapsack polytopes: a survey ⋮ Sequence Independent Lifting for the Set of Submodular Maximization Problem ⋮ Cover by disjoint cliques cuts for the knapsack problem with conflicting items ⋮ A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting ⋮ Approximate and exact merging of knapsack constraints with cover inequalities ⋮ Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem ⋮ A polyhedral study on 0-1 knapsack problems with set packing constraints ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ On cutting planes for cardinality-constrained linear programs ⋮ Sequence independent lifting for a set of submodular maximization problems
Cites Work
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential 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
- The 0-1 knapsack problem with a single continuous variable
- On the facets of the mixed-integer knapsack polyhedron
- 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
- Sequence independent lifting for mixed integer programs with variable upper bounds
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- Sequence Independent Lifting for Mixed-Integer Programming
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
This page was built for publication: A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
