Algorithms for the robust 1-center problem on a tree
Authors:
- Igor AverbakhIAIgor Averbakh
- Oded BermanOBOded Berman
- 1 June 2000
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 123 (2) , 292-302
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Minmax-regret robust 1-median location on a treeNetworks, 1998
- Minimax regret p-center location on a network with demand uncertaintyLocation Science, 1997
- Robust Discrete Optimization and Its Applications1997
- Sensitivity Analysis in Minisum Facility Location ProblemsOperations Research, 1991
- Sensitivity analysis of the optimal location of a facilityNaval Research Logistics Quarterly, 1985
- Linear Time Algorithms for Two- and Three-Variable Linear ProgramsSIAM Journal on Computing, 1984
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- Optimal Center Location in Simple NetworksTransportation Science, 1971
- Letter to the Editor—Optimum Locations on Graphs with Correlated Normal DemandsOperations Research, 1967
- Optimum Locations on a Graph with Probabilistic DemandsOperations Research, 1966