A nonlinear minimax allocation problem with multiple knapsack constraints.
Hanan LussPublished in: Oper. Res. Lett. (1991)
Keyphrases
- multiple knapsack
- combinatorial optimization problems
- branch and bound
- min cost
- bin packing
- combinatorial optimization
- resource allocation problems
- max flow
- network flow
- neural network
- lower bound
- search algorithm
- knapsack problem
- optimal solution
- column generation
- branch and bound algorithm
- ant colony optimization
- metaheuristic
- optimization problems
- upper bound
- search space