A note on the extension complexity of the knapsack polytope.

Sebastian Pokutta Mathieu Van Vyve

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

Keyphrases

multi agent
knapsack problem
dynamic programming
real time
objective function
complexity analysis
real world
artificial intelligence
bayesian networks
computational complexity
special case
upper bound
worst case
decision problems
feasible solution