Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

A simple heuristic for the p-centre problem

1 references·15 citing·48 second hop

FromToDepth

this work references cited by second hop

References

1979Easy and hard bottleneck location problems215 cited

Cited by

2003Solving the p‐Center problem with Tabu Search and Variable Neighborhood Search160 cited
2008The stochastic -hub center problem with service-level constraints158 cited
1991Obnoxious Facility Location on Graphs147 cited
2002Continuous Covering Location Problems111 cited
2005A Florida County Locates Disaster Recovery Centers94 cited
1995Chapter 7 Location on networks53 cited
2015p-Center Problems50 cited
2015Improving the quality of heuristic solutions for the capacitated vertex p-center problem through iterated greedy local search with variable neighborhood descent26 cited
2022A Trade-Off Algorithm for Solving p-Center Problems with a Graph Convolutional Network25 cited
2005Demand Point Aggregation for Planar Covering Location Models24 cited
2011Solving the constrained p-center problem using heuristic algorithms23 cited
2003Lexicographic local search and the p-center problem20 cited
2003A framework for demand point and solution space aggregation analysis for location models20 cited
2004Aggregation Decomposition and Aggregation Guidelines for a Class of Minimax and Covering Location Models

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

19 cited

1991Heuristic cluster algorithm for multiple facility location-allocation problem18 cited