Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem.
Fumiaki TaniguchiTakeo YamadaSeiji KataokaPublished in: Comput. Oper. Res. (2008)
Keyphrases
- exact algorithms
- max min
- knapsack problem
- optimization problems
- optimal solution
- combinatorial optimization problems
- min max
- dynamic programming
- vehicle routing problem with time windows
- multidimensional knapsack problem
- heuristic solution
- np hard
- greedy heuristic
- greedy algorithm
- randomly generated test instances
- exact solution
- hill climbing
- robust optimization
- evolutionary algorithm
- max sat
- approximation algorithms
- combinatorial optimization
- special case
- linear programming
- state space