Distances to lattice points in knapsack polyhedra.

Iskander Aliev Martin Henk Timm Oertel

Published in: Math. Program. (2020)

Keyphrases

lattice points
geometric properties
knapsack problem
dynamic programming
special case
distance measure
distance function
line drawings
optimal solution
euclidean distance
dissimilarity measure
feasible solution
packing problem
hausdorff distance