A Lagrangean based solution algorithm for the multiple knapsack problem with setups.
Ali AmiriReza BarkhiPublished in: Comput. Ind. Eng. (2021)
Keyphrases
- knapsack problem
- optimal solution
- greedy heuristic
- dynamic programming
- implicit enumeration
- np hard
- learning algorithm
- combinatorial optimization problems
- test problems
- simulated annealing
- optimization problems
- solution quality
- mathematical model
- linear programming relaxation
- cutting plane
- exact algorithms
- branch and bound
- optimization algorithm
- linear programming
- search space
- computational complexity
- linear program
- particle swarm optimization
- cost function
- np hard problems
- objective function