On upper bounds for the multiple knapsack assignment problem.
Laura GalliAdam N. LetchfordPublished in: Oper. Res. Lett. (2024)
Keyphrases
- upper bound
- multiple knapsack
- branch and bound
- lower bound
- branch and bound algorithm
- np hard
- combinatorial optimization problems
- column generation
- upper and lower bounds
- worst case
- lower and upper bounds
- efficiently computable
- min cost
- neural network
- traveling salesman problem
- bin packing
- resource allocation problems
- tight upper and lower bounds
- knapsack problem
- packing problem