Login / Signup
A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem.
Stefan Balev
Nicola Yanev
Arnaud Fréville
Rumen Andonov
Published in:
Eur. J. Oper. Res. (2008)
Keyphrases
</>
multidimensional knapsack problem
dynamic programming
knapsack problem
lagrangian relaxation
tabu search
genetic algorithm
greedy algorithm
linear programming
multiple choice
neural network
shortest path
evolutionary algorithm
language model
branch and bound algorithm
integer programming
evolutionary strategy