1. Improving the location of minisum facilities through network modification

   • Oded Berman
   • Divinagracia I. Ingco
   • Amedeo R. Odoni

   OriginalPaper Pages: 1 - 16

2. A center location problem with congestion

   • Margaret L. Brandeau
   • Samuel S. Chiu

   OriginalPaper Pages: 17 - 32

3. Local convergence in a generalized Fermat-Weber problem

   • J. Brimberg
   • R. F. Love

   OriginalPaper Pages: 33 - 66

4. Probabilisticl _p distances in location models

   • Jack Brimberg
   • George O. Wesolowsky

   OriginalPaper Pages: 67 - 75

5. Location and allocation for distribution systems with transshipments and transportion economies of scale

   • James F. Campbell

   OriginalPaper Pages: 77 - 99

6. Locating facilities which interact: Some solvable cases

   • Dilip Chhajed
   • Timothy J. Lowe

   OriginalPaper Pages: 101 - 124

7. Forecast horizons and dynamic facility location planning

   • Mark S. Daskin
   • Wallace J. Hopp
   • Benjamin Medina

   OriginalPaper Pages: 125 - 151

8. A note on the Weber location problem

   • Zvi Drezner

   OriginalPaper Pages: 153 - 161

9. Asymptotic behavior of the Weber location problem on the plane

   • Zvi Drezner
   • David Simchi-Levi

   OriginalPaper Pages: 163 - 172

10. Competitive location in the plane

    • Zvi Drezner
    • E. Zemel

    OriginalPaper Pages: 173 - 193

11. Hotelling's duopoly on a tree

    • H. A. Eiselt

    OriginalPaper Pages: 195 - 207

12. A multiobjective model for locating undesirable facilities

    • Erhan Erkut
    • Susan Neuman

    OriginalPaper Pages: 209 - 227

13. On worst-case aggregation analysis for network location problems

    • Richard L. Francis
    • Timothy J. Lowe

    OriginalPaper Pages: 229 - 246

14. A network location-allocation model trading off flow capturing andp-median objectives

    • M. John Hodgson
    • Kenneth E. Rosing

    OriginalPaper Pages: 247 - 260

15. The dual of a generalized minimax location problem

    • Henrik Juel
    • Robert F. Love

    OriginalPaper Pages: 261 - 264

16. Good solutions to discrete noxious location problems via metaheuristics

    • Rex K. Kincaid

    OriginalPaper Pages: 265 - 281

17. Avoiding local optima in thep-hub location problem using tabu search and GRASP

    • John G. Klincewicz

    OriginalPaper Pages: 283 - 302

18. The capacitated standard response fire protection siting problem: Deterministic and probabilistic models

    • Vladimir Marianov
    • Charles ReVelle

    OriginalPaper Pages: 303 - 322

19. Capacitated emergency facility siting with multiple levels of backup

    • Sridhar Narasimhan
    • Hasan Pirkul
    • David A. Schilling

    OriginalPaper Pages: 323 - 337

20. A clustering approach to the planar hub location problem

    • M. E. O'Kelly

    OriginalPaper Pages: 339 - 353

21. On destination optimality in asymmetric distance Fermat-Weber problems

    • Frank Plastria

    OriginalPaper Pages: 355 - 369

22. Light traffic heuristic for anM/G/1 queue with limited inventory

    • Karl Sigman
    • David Simchi-Levi

    OriginalPaper Pages: 371 - 380

23. Demand sensitivity to space-price competition with Manhattan and Euclidean representations of distance

    • Jean-Claude Thill
    • Gerard Rushton

    OriginalPaper Pages: 381 - 401