A Lagrangean Heuristic for a Modular Capacitated Location Problem.
Isabel CorreiaM. Eugénia V. CaptivoPublished in: Ann. Oper. Res. (2003)
Keyphrases
- network design problem
- lagrangean relaxation
- heuristic solution
- optimal solution
- multi commodity
- grasp with path relinking
- facility location problem
- lagrangian relaxation
- vehicle routing problem with stochastic demands
- feasible solution
- mixed integer programming
- np hard
- column generation
- lower bound
- set covering problem
- branch and bound
- dynamic programming
- capacity constraints
- search algorithm
- location information
- tabu search
- simulated annealing
- multi item
- lot sizing
- upper bound
- network flow problem
- single source
- linear programming
- mixed integer
- routing problem
- vehicle routing problem
- branch and bound algorithm
- combinatorial optimization
- network design
- multi source
- search space
- search procedure