Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network

10 references·3 citing·29 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
1979Easy and hard bottleneck location problems215 cited
1973Minimax Location of a Facility in an Undirected Tree Graph190 cited
1972Minimax Location of a Facility in a Network96 cited
1976Convex Location Problems on Tree Networks95 cited
1981Location on Tree Networks: P-Centre and n-Dispersion Problems94 cited
1974A Minimax Location Problem on a Network79 cited
1982Polynomially bounded algorithms for locatingp-centers on a tree68 cited
1978Distance Constraints for Tree Network Multifacility Location Problems55 cited
1979Locating Rural Social Service Centers in India55 cited

Cited by

2015Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex $$p$$ p -centre problems38 cited
2002Obnoxious-facility location and data-envelopment analysis: A combined distance-based formulation31 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