On facets of knapsack equality polytopes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3566549 (Why is no real title available?)
- Computing low-capacity 0–1 knapsack polytopes
- 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
- On the \(0/1\) knapsack polytope
- Solving a truck dispatching scheduling problem using branch-and-cut
Cited in
(10)- A concise characterization of strong knapsack facets
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
- scientific article; zbMATH DE number 1187156 (Why is no real title available?)
- Easily Computable Facets of the Knapsack Polytope
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope
- On integer polytopes with few nonzero vertices
- Solving a truck dispatching scheduling problem using branch-and-cut
- Hard Equality Constrained Integer Knapsacks
- On the facets of the mixed-integer knapsack polyhedron
- Knapsack polytopes: a survey
This page was built for publication: On facets of knapsack equality polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367796)