A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem.
Yourim YoonYong-Hyuk KimByung Ro MoonPublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- multidimensional knapsack problem
- lagrangian relaxation
- knapsack problem
- genetic algorithm
- tabu search
- evolutionary strategy
- feasible solution
- particle swarm optimization
- multiple choice
- integer programming
- linear programming
- dynamic programming
- optimal solution
- upper bound
- evolutionary algorithm
- lower bound
- search algorithm