Cover inequalities for robust knapsack sets - Application to the robust bandwidth packing problem.

Olivier Klopfenstein Dritan Nace

Published in: Networks (2012)

Keyphrases

packing problem
training data
computationally efficient
feature space
lower bound
dynamic programming
upper bound
transfer learning
linear program
bin packing