A Lagrangean heuristic for the maximal covering location problem
Top Cited Papers
- 13 January 2011
- journal article
- Published by Elsevier
- Vol. 88 (1) , 114-123
- https://doi.org/10.1016/0377-2217(94)00159-6
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Bicriterion Maximal Covering Location Formulation Which Considers the Satisfaction of Uncovered DemandDecision Sciences, 1991
- The capacitated maximal covering location problem with backup serviceAnnals of Operations Research, 1989
- Note—Single and Double Vertex Substitution in Heuristic Procedures for the p-Median ProblemManagement Science, 1978
- The maximal covering location problemPapers in Regional Science, 1974
- An Algorithm for the M-Median Plant Location ProblemTransportation Science, 1974
- On Covering Problems and the Central Facilities Location ProblemGeographical Analysis, 1974
- Algorithms for Large-scale Travelling Salesman ProblemsJournal of the Operational Research Society, 1972
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted GraphOperations Research, 1968
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965