A polyhedral study on 0-1 knapsack problems with set packing constraints.

Roberto Cañavate Mercedes Landete

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

Keyphrases

knapsack problem
formally define
maximum profit
dynamic programming
combinatorial optimization problems
linear constraints
decision variables
learning algorithm
simulated annealing
convex hull
lower and upper bounds