A minmax regret median problem on a tree under uncertain locations of the demand points
From MaRDI portal
Publication:2450737
Recommendations
- An improved algorithm for the minmax regret median problem on a tree
- Minmax-regret robust 1-median location on a tree
- Minmax Regret Median Location on a Network Under Uncertainty
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
- A linear time algorithm for computing minmax regret 1-median on a tree network
Cites work
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
- An improved algorithm for the minmax regret median problem on a tree
- Lexicographic \(\alpha\)-robustness: an application to the 1-median problem
- Minmax-regret robust 1-median location on a tree
- Network flows. Theory, algorithms, and applications.
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
Cited in
(5)- An improved algorithm for the minmax regret median problem on a tree
- The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
- A note on the minmax regret centdian location on trees
- Facility location problems with uncertainty on the plane
- scientific article; zbMATH DE number 6311584 (Why is no real title available?)
This page was built for publication: A minmax regret median problem on a tree under uncertain locations of the demand points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450737)