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.005zbMATH Open1241.90128OpenAlexW2064267171MaRDI QIDQ429688FDOQ429688
Authors: Jean-Philippe 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
Recommendations
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
- scientific article; zbMATH DE number 2086929
- A polyhedral study of the cardinality constrained knapsack problem
- A polyhedral study on 0-1 knapsack problems with set packing constraints
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope
- A polyhedral study of the semi-continuous knapsack problem
- Facet defining inequalities for the dichotomous knapsack problem
- Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
- Polyhedral results for the precedence-constrained knapsack problem
Cites Work
- Title not available (Why is that?)
- Sequence independent lifting in mixed integer programming
- Easily Computable Facets of the Knapsack Polytope
- 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
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- A note on the knapsack problem with special ordered sets
- The Multiple-Choice Knapsack Problem
- Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
- Scheduling problems in a practical allocation model
- A capacity allocation problem with integer side constraints
- On the \(0/1\) knapsack polytope
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- Title not available (Why is that?)
- A computational study of a multiple-choice knapsack algorithm
- Lifting the facets of zero–one polytopes
- (1,k)-configurations and facets for packing problems
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
- Solving Multiple Knapsack Problems by Cutting Planes
- Second-order cover inequalities
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
Cited In (12)
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- Title not available (Why is that?)
- Knapsack polytopes: a survey
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
- 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
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items
- Optimization algorithms for the disjunctively constrained knapsack problem
- On cutting planes for cardinality-constrained linear programs
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
Uses Software
This page was built for publication: A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429688)
