Sensitivity analysis in minisum facility location problems
Operations Research
Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems
IEEE Transactions on Parallel and Distributed Systems
Finding Cores of Limited Length
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Minmax Regret Median Location on a Network Under Uncertainty
INFORMS Journal on Computing
Complexity of robust single facility location problems on networks with uncertain edge lengths
Discrete Applied Mathematics
An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree
Operations Research Letters
Facility location problems with uncertainty on the plane
Discrete Optimization
Minmax regret solutions for minimax optimization problems with uncertainty
Operations Research Letters
Minimax Regret Single-Facility Ordered Median Location Problems on Networks
INFORMS Journal on Computing
| Hi-index | 0.00 |
In this article, efficient algorithms are presented for the minmax-regret 1-center and 1-median problems on a general graph and a tree with uncertain vertex weights. For the minmax-regret 1-center problem on a general graph, we improve the previous upper bound from O(mn2 log n) to O(mn log n). For the problem on a tree, we improve the upper bound from O(n2) to O(n log2 n). For the minmax-regret 1-median problem on a general graph, we improve the upper bound from O(mn2 log n) to O(mn2 + n3 log n). For the problem on a tree, we improve the upper bound from O(n log2 n) to O(n log n).