On the existence of compact ε-approximated formulations for knapsack in the original space.

Yuri Faenza Laura Sanità

Published in: Oper. Res. Lett. (2015)

Keyphrases

dynamic programming
search space
low dimensional
low dimensionality
knapsack problem
upper bound
higher dimensional
machine learning
optimal solution
probability distribution
space time