# Facility location

**DOI:**https://doi.org/10.1007/1-4020-0611-X_327

- 41 Downloads

## INTRODUCTION

Location problems which can be quantified as optimization problems are natural candidates for operations research approaches, and many such problems have been studied using mathematical programming methodology. This article attempts to give an overview of some of this activity. Models of these location problems are classified as planar, network, and mixed integer programming models, and methodology for solving such types of models is outlined. Most of the contributions of operations research/management science (OR/MS) to location theory have occurred within the last 30 years. This period constitutes about 60% of the life-time of the profession itself, which is little more than 50 years old. We think there is little doubt that the contributions consist principally of algorithms — well-defined computational procedures for solving quantifiable problems. These algorithms have built largely upon results in an area known as mathematical programming, which began soon after World...

## References

- [1]Francis, R.L., Lowe, T.J., Rushton, G., and Rayco, B. (1999). “A Synthesis of Aggregation Methods for Multifacility Location Problems: Strategies for Containing Error,” Geographical Analysis, 31, 67–87.Google Scholar
- [2]Francis, R., McGinnis, L.F., and White, J.A. (1992). Facility Layout and Location: An Analytical Approach, Prentice Hall, Englewood Cliffs, New Jersey.Google Scholar
- [3]Handler, G.Y. and Mirchandani, P.B. (1979). Location on Networks: Theory and Algorithms, MIT Press, Cambridge, Massachusetts.Google Scholar
- [4]Hooker, J.N., Garfinkel, R.S., and Chen, C.K. (1991). “Finite Dominating Sets for Network Location Problems,” {Operations Research}, 39, 100–118Google Scholar
- [5]Love, R.F., Morris, J.G., and Wesolowsky, G.O. (1988).
*Facilities Location: Models and Methods*, North-Holland, AmsterdamGoogle Scholar