On the Complexity of Separation from the Knapsack Polytope.

Alberto Del Pia Jeff T. Linderoth Haoran Zhu

Published in: IPCO (2022)

Keyphrases

knapsack problem
computational complexity
dynamic programming
upper bound
worst case
decision problems
convex hull
stable set
machine learning
computer vision
lattice points