Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

A dynamic programming heuristic for the P-median problem

10 references·5 citing·36 second hop

FromToDepth

this work references cited by second hop

References

1964Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph2,425 cited
1991Discrete location theory1,284 cited
1997Network and Discrete Location: Models, Algorithms and Applications.1,220 cited
1983A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution815 cited
1964On the Location of Supply Points to Minimize Transport Costs347 cited
1982APPLICATION OF AN EXPECTED COVERING MODEL TO EMERGENCY MEDICAL SERVICE SYSTEM DESIGN*186 cited
1992A MORE EFFICIENT HEURISTIC FOR SOLVING LARGE P‐MEDIAN PROBLEMS127 cited
1982A tree search algorithm for the p-median problem117 cited
1984The p -Median Structure as a Unified Linear Model for Location—Allocation Analysis107 cited
1971A decomposition algorithm for a class of facility location problems79 cited

Cited by

2020Mitigating partial-disruption risk: A joint facility location and inventory model considering customers’ preferences and the role of substitute products and backorder offers29 cited
2005Methods for Solving the p-Median Problem: An Annotated Bibliography28 cited
2012P-medyan Tesis Yeri Seçim Problemi ve Çözüm Yaklaşımları20 cited
2019The dynamic p-median problem with mobile facilities20 cited

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

2006Uma heurística de localização-alocação (HLA) para problemas de localização de facilidades14 cited