The intersection of knapsack polyhedra and extensions
From MaRDI portal
Recommendations
- Polyhedral properties for the intersection of two knapsacks
- Knapsack polytopes: a survey
- On the multiple integer knapsack polyhedra
- On the facets of the mixed-integer knapsack polyhedron
- A note on the extension complexity of the knapsack polytope
- Facets of the knapsack polytope derived from disjoint and overlapping index configurations
- On the \(0/1\) knapsack polytope
- On facets of knapsack equality polytopes
- The Integer Knapsack Cover Polyhedron
- A knapsack intersection hierarchy
Cited in
(15)- On the facets of the mixed-integer knapsack polyhedron
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- Polyhedral properties for the intersection of two knapsacks
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items
- Easily Computable Facets of the Knapsack Polytope
- The Integer Knapsack Cover Polyhedron
- scientific article; zbMATH DE number 729909 (Why is no real title available?)
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
- Classical cuts for mixed-integer programming and branch-and-cut
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- A knapsack intersection hierarchy
- Cutting planes in integer and mixed integer programming
- Knapsack polytopes: a survey
- Convex hulls of superincreasing knapsacks and lexicographic orderings
This page was built for publication: The intersection of knapsack polyhedra and extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840363)
