A Complexity and Approximability Study of the Bilevel Knapsack Problem.

Alberto Caprara Margarida Carvalho Andrea Lodi Gerhard J. Woeginger

Published in: IPCO (2013)

Keyphrases

knapsack problem
dynamic programming
computational complexity
test problems
combinatorial optimization problems
neural network
objective function
cost function
np hard
optimization problems
linear programming
approximation algorithms
implicit enumeration