Locating centers in a dynamically changing network, and related problems
- 31 December 1998
- journal article
- Published by Elsevier in Location Science
- Vol. 6 (1-4) , 243-256
- https://doi.org/10.1016/s0966-8349(98)00048-5
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- The Maximum Capture Problem with UncertaintyEnvironment and Planning B: Planning and Design, 1996
- A modified greedy heuristic for the Set Covering problem with improved worst case boundInformation Processing Letters, 1993
- A unified approach to approximation algorithms for bottleneck problemsJournal of the ACM, 1986
- A Best Possible Heuristic for the k-Center ProblemMathematics of Operations Research, 1985
- Computational Procedures for Location Problems on Stochastic NetworksTransportation Science, 1983
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- Locations of Medians on Stochastic NetworksTransportation Science, 1979
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975