An exact algorithm for the fixed-charge multiple knapsack problem.
Takeo YamadaTakahiro TakeokaPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- knapsack problem
- exact algorithms
- fixed charge
- combinatorial optimization problems
- np hard
- dynamic programming
- transportation problem
- optimal solution
- production planning
- optimization problems
- branch and bound algorithm
- network design
- integer programming
- greedy algorithm
- scheduling problem
- state space
- maximum profit
- genetic algorithm
- linear programming
- simulated annealing
- network flow problem
- evolutionary algorithm