A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem.
Abdelkader SbihiPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- knapsack problem
- max min
- optimal solution
- dynamic programming
- cooperative
- search space
- np hard
- test problems
- greedy heuristic
- learning algorithm
- hill climbing
- combinatorial optimization problems
- multistage
- machine learning
- min max
- neural network
- search procedure
- convergence rate
- tabu search
- linear programming
- heuristic methods
- cost function
- objective function
- implicit enumeration