On the minmax regret path median problem on trees
From MaRDI portal
Publication:2353396
Recommendations
- On the minmax regret path center problem on trees
- An improved algorithm for the minmax regret path center problem on trees
- An improved algorithm for the minmax regret path centdian problem on trees
- An improved algorithm for the minmax regret median problem on a tree
- Improved Algorithms for the Minmax Regret 1-Median Problem
Cites work
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- A linear algorithm for a core of a tree
- A note on the minmax regret centdian location on trees
- A note on the robust 1-center problem on trees
- Algorithms for central-median paths with bounded length on trees
- Algorithms for the robust 1-center problem on a tree
- An O(pn^ 2) algorithm for the p-median and related problems on tree graphs
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An improved algorithm for the minmax regret median problem on a tree
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
- Complexity of robust single facility location problems on networks with uncertain edge lengths.
- Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
- Facility location problems with uncertainty on the plane
- scientific article; zbMATH DE number 961964 (Why is no real title available?)
- Improved algorithms for the minmax-regret 1-center and 1-median problems
- Letter to the Editor—Optimum Locations on Graphs with Correlated Normal Demands
- Location theory. A unified approach
- Minimax regret p-center location on a network with demand uncertainty
- Minimax regret path location on trees
- Minimax regret single-facility ordered median location problems on networks
- Minmax Regret Median Location on a Network Under Uncertainty
- Minmax-regret robust 1-median location on a tree
- On locating path- or tree-shaped facilities on networks
- Optimum Locations on a Graph with Probabilistic Demands
- Robust discrete optimization and its applications
- Sensitivity Analysis in Minisum Facility Location Problems
- Sensitivity analysis of the optimal location of a facility
- The optimal location of a path or tree in a tree network
Cited in
(17)- 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
- Efficient algorithms for the minmax regret path center problem with length constraint 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
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
- Minimax regret path location on trees
- A linear time algorithm for computing minmax regret 1-median on a tree network
- Computing minmax regret 1-median on a tree network with positive/negative vertex weights
- Improved algorithms for the minmax-regret 1-center and 1-median problems
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
- Robust reverse 1-center problems on trees with interval costs
- Combinatorial algorithms for the minmax robust median subtree problem on tree networks with interval vertex weights
- On the minmax regret path center problem 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
This page was built for publication: On the minmax regret path median problem on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353396)
