Hybrid approaches for the two-scenario max-min knapsack problem.
Saïd HanafiRaïd MansiChristophe WilbautArnaud FrévillePublished in: Int. Trans. Oper. Res. (2012)
Keyphrases
- knapsack problem
- max min
- hybrid approaches
- combinatorial optimization problems
- min max
- optimal solution
- optimization problems
- dynamic programming
- exact algorithms
- greedy algorithm
- multidimensional knapsack problem
- np hard
- linear programming relaxation
- neural network
- heuristic solution
- bicriteria
- robust optimization
- greedy heuristic
- maximum profit
- hill climbing
- search space
- decision variables
- worst case