A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting

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

scientific article; zbMATH DE number 3874956 (Why is no real title available?)
scientific article; zbMATH DE number 193411 (Why is no real title available?)
(1,k)-configurations and facets for packing problems
A capacity allocation problem with integer side constraints
A computational study of a multiple-choice knapsack algorithm
A note on the knapsack problem with special ordered sets
A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
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 From Minimal Covers
Facets of the knapsack polytope
Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
Lifting the facets of zero–one polytopes
On the \(0/1\) knapsack polytope
Scheduling problems in a practical allocation model
Second-order cover inequalities
Sequence independent lifting in mixed integer programming
Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
Solving Multiple Knapsack Problems by Cutting Planes
The Multiple-Choice Knapsack Problem
Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints

Cited in

(12)

Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
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
A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
scientific article; zbMATH DE number 2086929 (Why is no real title available?)
Optimization algorithms for the disjunctively constrained knapsack problem
Knapsack polytopes: a survey
Cover by disjoint cliques cuts for the knapsack problem with conflicting items

Describes a project that uses

Uses Software

CPLEX

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)