| 1 The Weber Problem | p. 1 |
Zvi Drezner and Kathrin Kalmroth and Anita Schöbel and George O. Wesolowsky| 1.1 Introduction | p. 1 |
| 1.2 History and Literature Review | p. 3 |
| 1.3 Solution Procedures | p. 6 |
| 1.4 Properties of the Weber Problem | p. 11 |
| 1.5 Other Distance Measures | p. 13 |
| 1.6 Multiple Facilities | p. 16 |
| 1.7 Restricted Weber Problems | p. 18 |
| 1.8 Line Location and Dimensional Facilities | p. 20 |
| 1.9 Extensions | p. 23 |
| 1.10 Epilogue | p. 24 |
| 5References | p. 24 |
| 2 Continuous Covering Location Problems | p. 37 |
Frank Plastria| 2.1 Introduction | p. 37 |
| 2.2 Full Covering | p. 45 |
| 2.3 Maximal Covering | p. 56 |
| 2.4 Empty Covering | p. 60 |
| 2.5 Minimal Covering | p. 63 |
| 2.6 Push-Pull Covering Models | p. 64 |
| 2.7 Positioning Models | p. 65 |
| 2.8 Multiple Facility Covering Location Models | p. 65 |
| 2.9 Extensive Facility Covering Location Models | p. 69 |
| References | p. 72 |
| 3 Discrete Network Location Models | p. 81 |
John Current and Mark Daskin and David Schilling| 3.1 Introduction | p. 81 |
| 3.2 Basic Facility Location Models | p. 82 |
| 3.3 Location-Routing Models | p. 95 |
| 3.4 Facility Location-Network Design Models | p. 96 |
| 3.5 Multiobjective Models | p. 96 |
| 3.6 Dynamic Location Models | p. 98 |
| 3.7 Stochastic Location Models | p. 98 |
| 3.8 Solution Approaches for Location Models | p. 101 |
| 3.9 Conclusions | p. 107 |
| References | p. 108 |
| 4 Location Problems in the Public Sector | p. 119 |
Vladimir Mrianov and Daniel Serra| 4.1 Introduction | p. 119 |
| 4.2 Covering Models in the Public Sector | p. 120 |
| 4.3 p-Median Models in Public Facility Location | p. 132 |
| 4.4 Conclusions | p. 142 |
| References | p. 143 |
| 5 Consumers in Competitive Location Models | p. 151 |
Tammy Drezner and H. A. Eiselt| 5.1 Introduction | p. 151 |
| 5.2 Incorporating Facilities Features | p. 155 |
| 5.3 The Lack of Rationality | p. 160 |
| 5.4 More Complex Customer Behavior | p. 164 |
| 5.5 Conclusions | p. 169 |
| References | p. 69 |
| 6 An Efficient Genetic Algorithm for the p-Median Problem | p. 179 |
Burcin Bozkaya and Jianjun Zhang and Erhan Erkut| 6.1 Introduction | p. 179 |
| 6.2 The p-Median Problem | p. 180 |
| 6.3 Genetic Algorithms | p. 182 |
| 6.4 Review of the Relevant Literature | p. 184 |
| 6.5 The Proposed Genetic Algorithm | p. 186 |
| 6.6 Computational Study | p. 192 |
| 6.7 Conclusions | p. 202 |
| References | p. 204 |
| 7 Demand Point Aggregation for Location Models | p. 207 |
Richard L. Francis and Timothy J. Lowe and Arie Tamir| 7.1 Introduction | p. 207 |
| 7.2 The Aggregation Problem | p. 208 |
| 7.3 Aggregation Error | p. 210 |
| 7.4 Guidelines for Aggregation | p. 214 |
| 7.5 An Aggregation Algorithm | p. 215 |
| 7.6 Computational Experience | p. 219 |
| 7.7 Error Bound Generalizations | p. 222 |
| 7.8 Summary | p. 229 |
| References p. 230 |
| 8 Location Software and Interface with GIS and Supply Chain Management | p. 233 |
Thorsten Bender and Holger Hennes and Jörg Kalcsics and M. Teresa Melo and Stefan Nickel| 8.1 Introduction | p. 233 |
| 8.2 LoLA- Library of Location Algorithms | p. 235 |
| 8.3 LoLA goes GIS | p. 249 |
| 8.4 Supply Chain Management | p. 255 |
| 8.5 Outlook | p. 271 |
| References | p. 272 |
| 9 Telecommunication and Location | p. 275 |
Eric Gourdin and Martine Labbé and Hande Yaman| 9.1 Introduction | p. 275 |
| 9.2 Uncapacitated Models | p. 278 |
| 9.3 Capacitated Concentrator Location Problem | p. 288 |
| 9.4 Capacitated Models | p. 299 |
| 9.5 Dynamic Models | p. 301 |
| References | p. 302 |
| 10 Reserve Design and Facility Siting | p. 307 |
Charles Re Velle and Justin C. Williams| 10.1 Introduction | p. 307 |
| 10.2 Set Covering Problems | p. 308 |
| 10.3 Maximal Covering Problems | p. 311 |
| 10.4 Redundant/Backup Coverage Problems | p. 313 |
| 10.5 Chance Constrained Covering Models | p. 316 |
| 10.6 Expected Covering Models | p. 323 |
| 10.7 Conclusion | p. 326 |
| References | p. 326 |
| 11 Facility Location Problems with Stochastic Demands and Congestion | p. 329 |
Oded Berman and Dmitry Krass| 11.1 Introduction | p. 329 |
| 11.2 Coverage Problems with Stochastic Demand and Congestion | p. 339 |
| 11.3 Problems with Median-Type Objective: The Stochastic Queue Mode | p. l356 |
| 11.4 Conclusions and Open Problems | p. 368 |
| References | p. 369 |
| 12 Hub Location Problems | p. 373 |
James F. Campbell and Andreas T. Ernest and Mohan Krishnamoorthy| 12.1 Introduction | p. 373 |
| 12.2 Background | p. 374 |
| 12.3 Recent Trends | p. 381 |
| 12.4 Models and Taxonomy | p. 383 |
| 12.5 Applications | p. 388 |
| 12.6 Solving Hub Location Problems | p. 393 |
| 12.7 Conclusions | p. 400 |
| References | p. 402 |
| 13 Location and Robotics | p. 409 |
Oliver Karch and Hartmut Noltemeier and Thomas Wahl| 13.1 Introduction | p. 409 |
| 13.2 Related Problems | p. 410 |
| 13.3 A Short Overview of the Localization Problem | p. 410 |
| 13.4 Solving the Geometric Problem | p. 413 |
| 13.5 A Sharper Bound for $$ | p. 417 |
| 13.6 Problems in Realistic Scenarios | p. 422 |
| 13.7 Adaptation to Practice | p. 424 |
| 13.8 Suitable Distances for d(S, V*) and D( ) | p. 426 |
| 13.9 Our Implementation RoLoPro | p. 432 |
| 13.10 Experimental Tests | p. 435 |
| 13.11 Possible Enhancements to the Algorithms | p. 436 |
| References | p. 436 |
| 14 The Quadratic Assignment Problem | p. 439 |
Franz Rendl| 14.1 Introductory Example | p. 439 |
| 14.2 Equivalent Formulations of QAP | p. 440 |
| 14.3 Applications | p. 442 |
| 14.4 Computational Complexity of QAP | p. 443 |
| 14.5 Relaxations of QAP | p. 443 |
| 14.6 Heuristics | p. 453 |
| 14.7 Computational Experience | p. 454 |
| 14.8 Bibliographical Notes | p. 455 |
| References | p. 455 |