Integer Points in Knapsack Polytopes and s-Covering Radius.

Iskander Aliev Martin Henk Eva Linke

Published in: Electron. J. Comb. (2013)

Keyphrases

integer points
convex hull
feasible solution
packing problem
knapsack problem
dynamic programming
integer variables
upper bound
optimal solution
np hard
mixed integer
convex sets
supervised learning
training samples
linear constraints
lagrangian relaxation