The Integer Knapsack Cover Polyhedron
From MaRDI portal
Recommendations
- Lifting for the integer knapsack cover polyhedron
- On the multiple integer knapsack polyhedra
- Knapsack polytopes: a survey
- On the facets of the mixed-integer knapsack polyhedron
- scientific article; zbMATH DE number 1187156
- Integer points in knapsack polytopes and s-covering radius
- Lifting the knapsack cover inequalities for the knapsack polytope
- Knapsack Cover Subject to a Matroid Constraint
- Description of 2-integer continuous knapsack polyhedra
- Complete description of a class of knapsack polytopes.
Cited in
(15)- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- scientific article; zbMATH DE number 1187156 (Why is no real title available?)
- On inequalities with bounded coefficients and pitch for the min knapsack polytope
- Valid inequalities, cutting planes and integrality of the knapsack polytope
- Lifting for the integer knapsack cover polyhedron
- Knapsack Cover Subject to a Matroid Constraint
- Knapsack polytopes: a survey
- Manufacturer's mixed pallet design problem
- Multi-cover inequalities for totally-ordered multiple knapsack sets
- On bounded pitch inequalities for the MIN-knapsack polytope
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- Integer points in knapsack polytopes and s-covering radius
- On integer polytopes with few nonzero vertices
- Supermodular covering knapsack polytope
- Facets of the Complementarity Knapsack Polytope
This page was built for publication: The Integer Knapsack Cover Polyhedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519194)
