Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Easy and hard bottleneck location problems

1 references·12 citing·40 second hop

FromToDepth

this work references cited by second hop

References

1978Locating an Obnoxious Facility on a Network229 cited

Cited by

1984An Analysis of Network Location Problems with Distance Constraints216 cited
1985A simple heuristic for the p-centre problem173 cited
2004A New Formulation and Resolution Method for the p-Center Problem162 cited
2015Location Science158 cited
1983Locational analysis147 cited
1983State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure136 cited
2002Continuous Covering Location Problems111 cited
2015p-Center Problems50 cited
1992On worst-case aggregation analysis for network location problems50 cited
2016A new compact formulation for the discrete p-dispersion problem48 cited
1982Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network45 cited
2022An Equity-Based Optimization Model to Solve the Location Problem for Healthcare Centers Applied to Hospital Beds and COVID-19 Vaccination36 cited

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