A Decomposition Heuristic for the Maximal Covering Location Problem.
Edson Luiz França SenneMarcos Antonio PereiraLuiz Antonio Nogueira LorenaPublished in: Adv. Oper. Res. (2010)
Keyphrases
- beam search
- optimal solution
- search algorithm
- dynamic programming
- search strategies
- website
- tabu search
- heuristic solution
- location information
- simulated annealing
- scheduling problem
- information systems
- location based services
- search procedure
- genetic algorithm
- lagrangian relaxation
- decomposition method
- data sets
- depth first search
- real time