A two-stage hybrid method for the multi-scenarios max-min knapsack problem.
Thekra AldouriMhand HifiPublished in: Int. J. Intell. Eng. Informatics (2018)
Keyphrases
- knapsack problem
- hybrid method
- max min
- min max
- combinatorial optimization problems
- np hard
- dynamic programming
- optimization problems
- optimal solution
- exact algorithms
- greedy algorithm
- multidimensional knapsack problem
- hybrid algorithm
- support vector machine
- robust optimization
- heuristic solution
- continuous relaxation
- randomly generated test instances
- hill climbing
- multiple objectives
- implicit enumeration
- learning algorithm
- maximum profit
- machine learning
- integer programming
- special case