Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Minimax regret p-center location on a network with demand uncertainty

3 references·16 citing·34 second hop

FromToDepth

this work references cited by second hop

References

1989Handbooks in operations research and management science2,388 cited
1991Discrete location theory1,284 cited
1992Location on networks175 cited

Cited by

2020A Review of Robust Operations Management under Model Uncertainty96 cited
2020A review of hydrogen station location models88 cited
2000Algorithms for the robust 1-center problem on a tree83 cited
2013Robust weighted vertex p-center model considering uncertain data: An application to emergency management78 cited
2013Robust vertex p-center model for locating urgent relief distribution centers74 cited
2010The facility location problem with Bernoulli demands68 cited
2015Facility Location Under Uncertainty68 cited
2012Pick‐up locations and bus allocation for transit‐based evacuation planning with demand uncertainty68 cited
2019A two-stage robust model for a reliable p-center facility location problem64 cited
2013Robust Facility Location Problem for Hazardous Waste Transportation63 cited
2015p-Center Problems50 cited
2010The minmax regret gradual covering location problem on a network with incomplete information of demand weights

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

49 cited

1999Location Models in Transportation48 cited

2008Minimax Regret Single-Facility Ordered Median Location Problems on Networks38 cited

2015A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty38 cited

2020Capacitated multi-period maximal covering location problem with server uncertainty34 cited