Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints.
Vincent C. LiPublished in: Comput. Oper. Res. (2005)
Keyphrases
- tabu search
- multidimensional knapsack problem
- upper bound
- lower bound
- lower and upper bounds
- metaheuristic
- simulated annealing
- feasible solution
- worst case
- memetic algorithm
- scheduling problem
- path relinking
- genetic algorithm
- knapsack problem
- benchmark instances
- search algorithm
- branch and bound
- iterated local search
- branch and bound algorithm
- test problems
- vehicle routing problem
- job shop scheduling problem
- hybrid algorithm
- heuristic methods
- tabu search algorithm
- lagrangian relaxation
- quadratic assignment problem
- np hard
- combinatorial problems
- tabu list
- initial solution
- search procedure
- constraint programming
- constraint satisfaction
- multiple choice
- optimal solution
- special case
- constrained optimization
- computational complexity
- neural network
- dynamic programming
- variable neighborhood search
- linear programming