An improved algorithm for the minmax regret median problem on a tree
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Robust location problems with pos/neg weights on a treeNetworks, 2001
- Algorithms for the robust 1-center problem on a treeEuropean Journal of Operational Research, 2000
- Minmax Regret Median Location on a Network Under UncertaintyINFORMS Journal on Computing, 2000
- Minmax-regret robust 1-median location on a treeNetworks, 1998
- Robust Discrete Optimization and Its Applications1997
- Sensitivity Analysis in Minisum Facility Location ProblemsOperations Research, 1991
- Linear Time Algorithms for Two- and Three-Variable Linear ProgramsSIAM Journal on Computing, 1984
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- An Algorithmic Approach to Network Location Problems. II: Thep-MediansSIAM Journal on Applied Mathematics, 1979
- Optimal Center Location in Simple NetworksTransportation Science, 1971