Approximate formulations for 0-1 knapsack sets.

Daniel Bienstock

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

Keyphrases

dynamic programming
upper bound
knapsack problem
social networks
case study
optimal solution
genetic algorithm
artificial intelligence
image sequences
learning environment
expert systems
cost function
feasible solution
optimization methods
set theoretic