Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

New heuristic algorithms for solving the planar p-median problem

14 references·5 citing·37 second hop

FromToDepth

this work references cited by second hop

References

1963Location-Allocation Problems932 cited
1964Heuristic Methods for Location-Allocation Problems535 cited
1997Variable neighborhood search for the p-median395 cited
2003An Efficient Genetic Algorithm for the p-Median Problem335 cited
1971Distribution management : mathematical modelling and practical analysis310 cited
2000Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem274 cited
1983A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems186 cited
1984The Planar Two-Center and Two-Median Problems121 cited
1992GBSSS: The generalized big square small square method for planar single-facility location118 cited
2007A Survey of Solution Methods for the Continuous Location-Allocation Problem95 cited
1994A projection method forl p norm location-allocation problems91 cited
2003A Genetic Algorithm Based Approach for the Uncapacitated Continuous Location–Allocation Problem82 cited
2013A new local search for continuous location problems72 cited
2002Using hybrid metaheuristics for the one‐way and two‐way network design problem53 cited

Cited by

2019

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

Introduction to Location Science

51 cited

2015Introduction to Location Science37 cited

2015Incorporating neighborhood reduction for the solution of the planar p-median problem34 cited

2020Using metaheuristics for the location of bicycle stations31 cited

2017Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems27 cited