Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search.
Vincent Chi-Wei LiGuy L. CurryPublished in: Comput. Oper. Res. (2005)
Keyphrases
- tabu search
- multidimensional knapsack problem
- upper bound
- metaheuristic
- simulated annealing
- feasible solution
- search heuristics
- scheduling problem
- mixed integer program
- lower and upper bounds
- knapsack problem
- lower bound
- search procedure
- genetic algorithm
- path relinking
- test problems
- combinatorial optimization
- search algorithm
- memetic algorithm
- multi start
- worst case
- heuristic methods
- search algorithm for solving
- job shop scheduling problem
- iterated local search
- vehicle routing problem
- tabu search algorithm
- scatter search
- hybrid algorithm
- combinatorial problems
- tabu list
- neural network
- branch and bound
- evolutionary algorithm
- initial solution
- branch and bound algorithm
- constraint programming
- evolutionary strategy
- timetabling problem
- max sat
- search space
- lagrangian relaxation
- mixed integer
- np hard
- dynamic programming
- optimization problems