Solving the maximal covering location problem with heuristic concentration.
Charles S. RevelleMichelle ScholssbergJustin C. WilliamsPublished in: Comput. Oper. Res. (2008)
Keyphrases
- combinatorial optimization
- finding an optimal solution
- timetabling problem
- variable ordering
- optimal solution
- simulated annealing
- search algorithm
- dynamic programming
- constraint satisfaction
- dynamic programming algorithms
- heuristic methods
- sliding tile
- data sets
- mixed integer program
- search heuristics
- finding optimal
- search procedure
- branch and bound
- optimization problems