A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem.
Mustafa AvciSeyda TopalogluPublished in: Comput. Oper. Res. (2017)
Keyphrases
- knapsack problem
- search algorithm
- multi start
- exact algorithms
- combinatorial optimization problems
- vehicle routing problem with time windows
- optimal solution
- optimization problems
- tabu search
- np hard
- dynamic programming
- metaheuristic
- test problems
- global optimization
- cutting plane
- objective function
- machine learning
- neural network
- branch and bound
- greedy algorithm
- search space
- computational complexity