On the minmax regret path median problem on trees
From MaRDI portal
Publication:2353396
DOI10.1016/j.jcss.2015.01.002zbMath1321.90075OpenAlexW1985602512MaRDI QIDQ2353396
Publication date: 13 July 2015
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2015.01.002
Related Items (6)
Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ Extensive facility location problems on networks: an updated review ⋮ An improved algorithm for the minmax regret path centdian problem on trees ⋮ An improved algorithm for the minmax regret path center problem on trees ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
Cites Work
- Unnamed Item
- Algorithms for central-median paths with bounded length on trees
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
- A note on the minmax regret centdian location on trees
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- Robust discrete optimization and its applications
- Algorithms for the robust 1-center problem on a tree
- Facility location problems with uncertainty on the plane
- Complexity of robust single facility location problems on networks with uncertain edge lengths.
- A note on the robust 1-center problem on trees
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- Minimax Regret Single-Facility Ordered Median Location Problems on Networks
- Minimax regret path location on trees
- Location Theory
- On locating path- or tree-shaped facilities on networks
- Sensitivity analysis of the optimal location of a facility
- The optimal location of a path or tree in a tree network
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A linear algorithm for a core of a tree
- Sensitivity Analysis in Minisum Facility Location Problems
- Minimax regret p-center location on a network with demand uncertainty
- Minmax-regret robust 1-median location on a tree
- Minmax Regret Median Location on a Network Under Uncertainty
- An improved algorithm for the minmax regret median problem on a tree
- Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
- Improved algorithms for the minmax-regret 1-center and 1-median problems
- Optimum Locations on a Graph with Probabilistic Demands
- Letter to the Editor—Optimum Locations on Graphs with Correlated Normal Demands
This page was built for publication: On the minmax regret path median problem on trees
