Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Optimal algorithms for the α-neighbor p-center problem

14 references·1 citing·28 second hop

FromToDepth

this work references cited by second hop

References

1971The Location of Emergency Service Facilities1,860 cited
1997Network and Discrete Location: Models, Algorithms and Applications.1,220 cited
1983A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution815 cited
1986Concepts and Applications of Backup Coverage468 cited
1989The Maximum Availability Location Problem422 cited
1981A Hierarchical Objective Set Covering Model for Emergency Medical Service Vehicle Deployment389 cited
1996The Queueing Maximal availability location problem: A model for the siting of emergency vehicles291 cited
1979Location on Networks: Theory and Algorithms280 cited
1996Network and discrete location models, algorithms and applications205 cited
2008New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems65 cited
2003The Multi-level Location Set Covering Model41 cited
1987Relaxation method for the solution of the minimax location-allocation problem in euclidean space29 cited
2011Mobile phone tower location for survival after natural disasters27 cited
2004New Trends in Public Facility Location Modeling23 cited

Cited by

2018

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

Optimal solutions for the continuous p-centre problem and related -neighbour and conditional problems: A relaxation-based algorithm

17 cited