A Branch-and-Price Algorithm for the Multiple Knapsack Problem.
Olivier LalondeJean-François CôtéBernard GendronPublished in: INFORMS J. Comput. (2022)
Keyphrases
- knapsack problem
- optimal solution
- dynamic programming
- np hard
- learning algorithm
- implicit enumeration
- computational complexity
- test problems
- objective function
- lower bound
- particle swarm optimization
- search space
- simulated annealing
- greedy heuristic
- multidimensional knapsack problem
- k means
- worst case
- optimization problems
- optimization algorithm
- genetic algorithm
- machine learning