Citation map · Study

SZodixStudyAcademic Library

Dashboard Shelves Open access My library Inbox Notes Write Learn Alerts

More

Ask your library Notifications Quick cite Review

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

Location on Tree Networks: P-Centre and n-Dispersion Problems

5 references·9 citing·31 second hop

FromToDepth

this work references cited by second hop

References

1964Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph2,425 cited
1971Optimal Center Location in Simple Networks386 cited
1978Locating an Obnoxious Facility on a Network229 cited
1973Minimax Location of a Facility in an Undirected Tree Graph190 cited
1972Minimax Location of a Facility in a Network96 cited

Cited by

1992Good solutions to discrete noxious location problems via metaheuristics71 cited
2021Review of obnoxious facilities location problems62 cited
2020Measuring diversity. A review and an empirical analysis50 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
1998Some personal views on the current state and the future of locational analysis44 cited
2006A Family of Location Models for Multiple‐Type Discrete Dispersion44 cited
2011The Location of Undesirable Facilities29 cited
1990The discrete p-Maxian location problem28 cited

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