The vertices of the knapsack polytope
From MaRDI portal
Publication:1056676
DOI10.1016/0166-218X(83)90067-7zbMath0523.90063MaRDI QIDQ1056676
Publication date: 1983
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
algorithm; combinatorial optimization; knapsack problem; knapsack polytope; smallest number of vertices
Related Items
On integer points in polyhedra, On integer points in polyhedra: A lower bound, Upper and lower bound results on the convex hull of integer points in polyhedra