Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

A LAGRANGEAN/SURROGATE HEURISTIC FOR THE MAXIMAL COVERING LOCATION PROBLEM USING HILLSMANS EDITION

9 references·3 citing·34 second hop

FromToDepth

this work references cited by second hop

References

1974THE MAXIMAL COVERING LOCATION PROBLEM2,749 cited
1997Network and Discrete Location: Models, Algorithms and Applications.1,220 cited
1996Facility Location: A Survey of Applications and Methods.887 cited
1970Central Facilities Location853 cited
1996A Lagrangean heuristic for the maximal covering location problem219 cited
1984The p -Median Structure as a Unified Linear Model for Location—Allocation Analysis107 cited
2000A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem98 cited
2000Lagrangean/Surrogate Heuristics for p-Median Problems69 cited
2000Network distance characteristics that affect computational effort in p-median location problems33 cited

Cited by

2020An improved fusion crossover genetic algorithm for a time-weighted maximal covering location problem for sensor siting under satellite-borne monitoring24 cited
2007A column generation approach for the maximal covering location problem21 cited
2010A decision support system for locating weapon and radar positions in stationary point air defence19 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work