Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Complexity of robust single facility location problems on networks with uncertain edge lengths

11 references·4 citing·27 second hop

FromToDepth

this work references cited by second hop

References

1995Robust Optimization of Large-Scale Systems1,959 cited
1991Discrete location theory1,284 cited
1997Robust Discrete Optimization and Its Applications1,172 cited
1998Robust Discrete Optimization and Its Applications.1,060 cited
1971Optimal Center Location in Simple Networks386 cited
1979Locations of Medians on Stochastic Networks158 cited
1998Minmax-regret robust 1-median location on a tree107 cited
1966Optimum Locations on a Graph with Probabilistic Demands89 cited
2000Minmax Regret Median Location on a Network Under Uncertainty87 cited
2000Algorithms for the robust 1-center problem on a tree83 cited
1995Chapter 7 Location on networks53 cited

Cited by

2008Minimax Regret Single-Facility Ordered Median Location Problems on Networks38 cited
2013Depot location in degradable transport networks33 cited
2020A robust p-Center problem under pressure to locate shelters in wildfire context26 cited
2013Bounds of Relative Regret Limit in p ‐Robust Supply Chain Network Design21 cited

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