A probabilistic one-centre location problem on a network
Authors:
- 1 August 2003
- journal article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 54 (8) , 871-877
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- CorrigendumACM Transactions on Mathematical Software, 1993
- Computation of the multivariate normal integralACM Transactions on Mathematical Software, 1992
- On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center ProblemMathematics of Operations Research, 1987
- The Complexity of Vertex Enumeration MethodsMathematics of Operations Research, 1983
- Optimum Location Probabilities in the lp Distance Weber ProblemTransportation Science, 1981
- An Algorithmic Approach to Network Location Problems. II: Thep-MediansSIAM Journal on Applied Mathematics, 1979
- Locations of Medians on Stochastic NetworksTransportation Science, 1979
- Probabilistic Weights in the One-Dimensional Facility Location ProblemManagement Science, 1977
- Minimax Location of a Facility in an Undirected Tree GraphTransportation Science, 1973
- The Minimum Covering Sphere ProblemManagement Science, 1972