A Decomposition Heuristic for the Maximal Covering Location Problem
This paper proposes a cluster partitioning technique to calculate improved upper bounds to the optimal solution of maximal covering location problems. Given a covering distance, a graph is built considering as vertices the potential facility locations, and with an edge connecting each pair of facili...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2010-01-01
|
| Series: | Advances in Operations Research |
| Online Access: | http://dx.doi.org/10.1155/2010/120756 |