A Lagrangean / Surrogate Heuristic for the Maximal Covering Location Problem Using Hillsman ́ S Edition


The Maximal Covering Location Problem (MCLP) deals with the location of facilities in order to attend the largest subset of a population within a service distance. Many successful heuristic approaches have been developed to solve this problem. In this work we use the Unified Linear Model developed by Hillsman to adapt the distance coefficients of a p-median… (More)

13 Figures and Tables


  • Presentations referencing similar topics