Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

An improved algorithm for the minmax regret median problem on a tree

7 references·4 citing·22 second hop

FromToDepth

this work references cited by second hop

References

1997Robust Discrete Optimization and Its Applications1,172 cited
1998Robust Discrete Optimization and Its Applications.1,060 cited
1971Optimal Center Location in Simple Networks386 cited
1998Minmax-regret robust 1-median location on a tree107 cited
2000Minmax Regret Median Location on a Network Under Uncertainty87 cited
2000Algorithms for the robust 1-center problem on a tree83 cited
1991Sensitivity Analysis in Minisum Facility Location Problems47 cited

Cited by

2008Minimax Regret Single-Facility Ordered Median Location Problems on Networks38 cited
2007A note on the minmax regret centdian location on trees27 cited
2014Minmax regret 1-facility location on uncertain path networks25 cited
2010A robust optimization model for p-median problem with uncertain edge lengths23 cited

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