Lagrangian relaxation guided problem space search heuristics for generalized assignment problems.
V. JeetErhan KutanogluPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- lagrangian relaxation
- search heuristics
- branch and bound search
- integer programming
- constraint programming
- lower bound
- branch and bound algorithm
- column generation
- dual decomposition
- np hard
- tabu search
- branch and bound
- search strategy
- lagrangian heuristic
- feasible solution
- search algorithm
- lower and upper bounds
- search space
- knapsack problem
- dynamic programming
- beam search
- evolutionary algorithm
- relaxation algorithm
- optimization problems
- genetic algorithm
- lagrangian dual