Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

A new compact formulation for the discrete p-dispersion problem

8 references·4 citing·36 second hop

FromToDepth

this work references cited by second hop

References

1995Network and Discrete Location916 cited
1989Analytical models for locating undesirable facilities394 cited
1990The discrete p-dispersion problem280 cited
1987Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion Problems218 cited
1979Easy and hard bottleneck location problems215 cited
2004A New Formulation and Resolution Method for the p-Center Problem162 cited
1981Location on Tree Networks: P-Centre and n-Dispersion Problems94 cited
2004Upper bounds and exact algorithms for -dispersion problems86 cited

Cited by

2018Mixed-integer programming models for tower crane selection and positioning with respect to mutual interference46 cited
2021Safe distancing in the time of COVID-1929 cited
2020Social Distancing as p-Dispersion Problem21 cited
2022Max–min dispersion with capacity and cost for a practical location problem17 cited

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