Hall, Kenneth M. 1970. An r-dimensional quadratic placement algorithm. Management Science \1-.2X9-219.

Handler, G. Y., and P. B. Mirchandani. 1979. Location on networks: Theory and algorithms. Cambridge, MA: MIT Press.

Hansen, P., D. Peeters, and J. F. Thisse. 1983. Public facility location models: A selective survey. In Location analysis of public facilities, eds. J. F. Thisse and H. G. Zoller. Amsterdam: North Holland.

Hansen, P., J. Perreur, and J. F. Thisse. 1980. Location theory, dominance and convexity: Some further results. Operations Research 28:1241-1250.

Hansen, P., and J. F. Thisse. 1983. Recent advances in continuous location theory. Sistemi Urbani 1:33-54.

Hardy, G. H., J. E. Littlewood, and G. Polya. 1952. Inequalities. London: Cambridge University Press.

Harvey, M. E., M. S. Hung, and J. R. Brown. 1973. The application of a p-median algorithm to the identification of nodal hierarchies and growth centers. Economic Geography 50:187-202.

Heam, D. H., and J. Vijay. 1982. Efficient algorithms for the (weighted) minimum circle problem. Operations Research 111-19 .

Hertz, D. ., and R. T. Eddison, (eds.). 1964. Progress in operations research, vol.11, 110-113. New York: Wiley.

Hillier, F. S., and M. Connors. 1966. Quadratic assignment algorithms and the location of indivisible facilities. Management Science 13:42-57.

Hogan, K., and C. ReVelle. 1986. Concepts and applications of backup coverage. Management Science 11:1434-1444.

Juel, H. 1975. Properties of location models. Ph.D. Dissertation, University of Wisconsin-Madison.

-. 1984. On a rational stopping rule for facilities location algorithms. Naval

Research Logistics Quarterly 31:9-11. Juel, H., and R. F. Love. 1976. An efficient computational procedure for solving multi-facility rectilinear facilities location problems. Operational Research Quarterly 27:697-703.

-. 1980. Sufficient conditions for optimal facility locations to coincide.

Transportation Science 14:125-129.

-. 1981a. On the dual of the linearly constrained multi-facility location

problem with arbitrary norms. Transportation Science 15:329-337.

-. 1981b. Fixed point optimality criteria for the location problem with ar-

bitrary norms. Journal of the Operational Research Society 32:891-897.

-. 1983a. The solution of location problems with certain existing facility

structures. fNFOR 21:145-150.

-. 1983b. Hull properties in location problems. European Journal of Op-

erational Research 12:262-265. Katz, I. N. 1969. On the convergence of a numerical scheme for solving some locational equilibrium problems. SIAM Journal of Applied Mathematics 17:1224-1231.

-. 1974. Local convergence in Fermats problem. Mathematical Programming 6:89-[04.

Katz, I. N., and L. Cooper. 1974. An always-convergent numerical scheme for a random locational equilibrium problem. SIAM Journal of Numerical Analysis 17:683-693.

-. 1976. Normally and exponentially distributed locational equiUbrium

problems. Journal of Research of the National Bureau of Standards 80B-53-73.

-. 1980. Optimal location on a sphere. Computers and Mathematics with

Applications 6:175-196.

Kaufman, L., and F. Broeckx. 1978. An algorithm for the quadratic assignment problem using Benders decomposition. European Journal of Operational Research. 2:204-211.

Keeney, R. L. 1980. Siting energy facilities. New York: Academic Press.

Kermack, K. A., and J. B. S. Haldane. 1950. Organic correlation and allometry. Biometrika 37:30-41.

Khumawala, B. M. 1972. An efficient branch and bound algorithm for the warehouse location problem. Management Science 18:718-731.

Kleindorfer, G. ., G. A. Kochenberger, and E. T. Reutzel. 1981. Computing inter-site distances for routing and scheduling problems. Operations Research Letters 1:31-33.

Kolen, A. J. W. 1986. Tree network and planar rectilinear location theory. Amsterdam: CWI Tract 25, CWI.

Kolesar, P., and W. E. Walker. 1974. An algorithm for the dynamic relocation of fire companies. Operations Research 22:249-274.

Kolesar, P., W. E. Walker, and J. Hausner. 1975. Determining the relation between fire engine travel times and travel distances in New York City. Operations Research 23:614-627.

KrarupjvJ., and P. M. Pruzan. 1983. The simple plant location problem: Survey and synthesis. European Journal of Operational Research 12:36-81.

Kuehn, A. A., and M. J. Hamburger. 1963. A heuristic program for locating warehouses. Management Science 10:643-666.

Kuenne, R. E., and R. M. Soland. 1972. Exact and approximate solution to the multisource Weber problem. Mathematical Programming 3:193-209.

Kuhn, H. W. 1967. On a pair of dual nonhnear problems. In Nonlinear programming, chapter 3, ed. J. Abadie. New York: Wiley.

-. 1973. A note on Fermats problem. Mathematical Programming 4:98-

107.

-. 1976. Nonlinear programming: An historical view. SIAM-AMS Proceedings 9:1-26.

Kusiak, A., and S. S. Heragu. 1987. The facility layout problem. European Journal

of Operational Research 29:229-251. Land, A. H. 1963. A problem of assignment with interrelated costs. Operational

Research Quarterly 14:185-198.

Laporte, G., Y. Nobert, and P. Pelletier. 1983. Hamiltonian location problems.

European Journal of Operational Research 12:82-89. Larson, R. C. 1974. A hypercube queuing model for facility location and redis-

tricting in urban emergency services. Computers and Operations Research 1:67-

Larson, R. C, and A. R. Odoni. 1981. Urban operations research. Englewood

Cliffs, NJ: Prentice-Hall. Lawler, E. L. 1963. The quadratic assignment problem. Management Science

9:586-599.

Lawson, C. L. 1965. The smallest covering cone or sphere. SIAM Review 7:415-417.

Leamer, E. E. 1968. Locational equilibria. Journal of Regional Science 8:229-242.

Litwhiler, D. W. 1977. Large region location problems. Ph.D. Dissertation, The

University of Oklahoma. Litwhiler, D. W., and A. A. Aly. 1979. Large region location problems. Computers

and Operations Research 6:1-12. Love, R. F. 1967a. The location of single facilities in three-dimensional space by

nonlinear programming. Journal of the Canadian Operational Research Society

5:136-143.

-. 1967b. A note on the convexity of siting depots. The International Journal

of Production Research 6:153-154.

-. 1969. Locating facilities in three-dimensional space by convex program-

ming. Naval Research Logistics Quarterly 16:503-516.

-. 1972. A computational procedure for optimally locating a facility with

respect to several rectangular regions. Journal of Regional Science 12:233-242. -. 1974. The dual of a hyperbolic approximation to the generalized con-

strained multifacility location problem with £„ distances. Management Science 21:22-33.

-. 1976. One-dimensional facility location-allocation using dynamic pro-

gramming. Management Science 22:614-617.

Love, R. F., and P. D. Dowling. 1985. Optimal weighted £„ norm parameters for facilities layout distance characteristics. Management Science 31:200-206.

-. 1986. A generalized bounding method for facilities location models. Research and Working Paper Series No. 250, Faculty of Business, McMaster University.

Love, R. F., and H. Juel. 1982. Properties and solution methods for large location-allocation problems. Journal of the Operational Research Society 33:443-452.

-. 1983. Hull properties in location problems. European Journal of Operational Research 12:262-265.

Love, R. P., and S. A. Kraemer. 1973. A dual decomposition method for minimizing transportation costs in multifacility location problems. Transportation Science 7:297-316.

Love, R. F., and J. G. Morris. 1972. Modelling inter-city road distances by mathematical functions. Operational Research Quarterly 23:61-71.

-. 1975a. A computational procedure for the exact solution of location-allocation problems with rectangular distances. Naval Research Logistics Quarterly 22:4M-453.

-. 1975b. Solving constrained multi-facility location problems involving

distances using convex programming. Operations Research 23:581-587.

-. 1979. Mathematical models of road travel distances. Management Science

25:130-139.

Love, R. F., W. G. Truscott, and J. H. Walker. 1985. Terminal location problem: A case study supporting the status quo. Journal of the Operational Research Society 36:131-136.

Love, R. F., G. O. Wesolowsky, and S. A. Kraemer. 1973. A multi-facility minimax location method for Euclidean distances. International Journal of Production Research 11:37-45.

Love, R. F., and J. Y. Wong. 1976a. Solving quadratic assignment problems with rectangular distances and integer programming. Naval Research Logistics Quarterly 23:623-627.

-. 1976b. On solving a one-dimensional space allocation problem with integer programming. INFOR 14:139-143.

Love, R. F., and W. Y. Yeong. 1981. A stopping rule for facilities location algorithms. AIIE Transactions 13:357-362.

Love, R. F., and L. Yerex. 1976. Application of a facilities location model in the prestressed concrete industry. Interfaces 6/4:45-49.

MacKinnon, R. D., and G. M. Barber. 1972. A new approach to network generation and map representation: The linear case of the location-allocation problem. Geographical Analysis 4:156-168.

Mairs, T. G., G. W. Wakefield, E. L. Johnson, and K. Spielberg. 1978. On a production allocation and distribution problem. Management Science 24:1622-1630.

Manne, A. S. 1964. Plant location under economies of scale-decentrahzation and commutation. Management Science 11:213-235.

Marucheck, A. S., and A. A. Aly. 1981. An efficient algorithm for the location-allocation problem with rectangular regions. Naval Research Logistics Quarterly 28:309-323.

Mavrides, L. P. 1979. An indirect method for the generalized -median problem applied to lock-box location. Management Science 25:990-996.

Miehle, W. 1958. Link-length minimization in networks. Operations Research 6:232-243.

Minieka, E. 1970. The w-center problem. SIAM Review 12:138-139. Morris, J. G. 1973. A linear programming approach to the solution of constrained multi-facility minimax location problems where distances are rectangular. Operational Research Quarterly 24:419-435.

-. 1978. On the extent to which certain fixed-charge depot location problems

can be solved by LP. Journal of the Operational Research Society 29:71-76. -. 1981. Convergence of the Weiszfeld algorithm for Weber problems using

a generalized "distance" function. Operations Research 29:37-48.

-. 1982. Lawsons algorithm for p-norm minimax facility problems. Paper

presented at the Joint National Meeting of ORSA/TIMS, San Diego. Morris, J. G., and J. P. Norback. 1980. A simple approach to linear facility

location. Transportation Science 14:1-8. Morris, J. G., and W. A. Verdini. 1979. A simple iterative scheme for solving

minisum facility location problems involving jp distances. Operations Research

27:1180-1188.

Nair, K. P. K., and R. Chandrasekaran. 1971. Optimal location of a single service

center of certain types. Naval Research Logistics Quarterly 18:503-510. Nauss, R. M., and R. E. Markland. 1981. Optimizing procedure for lock-box

analysis. Management Science 27:855-865. Nugent, C. E., T. E. Vollmann, and J. Ruml. 1968. An experimental comparison

of techniques for the assignment of facilities to locations. Operations Research

16:150-173.

OKelly, M. E. 1986. The location of interacting hub facilities. Transportation Science 20:92-106.

Ostresh, L. M., Jr. 1973. TWAIN-Exact solution to the two-source location-allocation problem. In Computer programs for location-allocation problems, eds. G. Rushton, M. F. Goodchild, and L. M. Ostresh, Jr. Iowa City: Monograph No. 6, Department of Geography, University of Iowa.

-. 1975. An efficient algorithm for solving the two center location-allocation

ReVelle, C, and R. Swain. 1970. Central facilities location. Geographical Analysis 2:30-42.

Ritzman, L. P. 1972. The efficiency of computer algorithms for plant layout.

Management Science 18:240-248. Roodman, G. M., and L. B. Schwarz. 1977. Extensions of the muhi-period facility

phase-out model: New procedures and apphcations to a phase-in/phase-out

problem. AIIE Transactions 9:103-107. Schilling, D., D. J. Elzinga, J. Cohon, R. Church, and C. ReVelle. 1979. The team/

fleet models for simultaneous facility and equipment siting. Transportation

Science 13:163-175.

Schrage, L. 1975. Implicit representation of variable upper bounds in linear programming. Mathematical Programming Study 4:118-132.

Scott, A. J. 1971. Combinatorial programming, spatial analysis and planning. London: Methuen.

Scriabin, M., and R. C. Vergin. 1975. Comparison of computer algorithms and visual based methods for plant layout. Management Science 22:172-181.

Sherali, A. D., and C. M. Shetty. 1977. The rectilinear distance location-allocation problem. AIIE Transactions 9:136-143.

Spath, H. 1978. Explizite losung des dreidimensonalen minimax-standortprob-lems in der city-block-distanz. Zeitschrift fur Operations Research 22:229-237.

Spielberg, K. 1969. An algorithm for the simple plant location problem with some

rems. Journal of Regional Science 17:409-419.

1978. On the convergence of a class of iterative methods for solving the

Weber location problem. Operations Research 26:597-609. Pardalos, P. M., and J. B. Rosen. 1986. Methods for concave minimization: A

bibliographic survey. SIAM Review 28:367-379. Pearson, K. 1901. On lines and planes of closest fit to systems of points in space.

Philosophical Magazine and Journal of Science, Sixth Series 2:559-572. Perreur, J., and J. Thisse. 1974. Central metrics and optimal location. Journal of

Regional Science 14:411 -421. Pierce, J. F., and W. B. Crowston. 1971. Tree search algorithms in quadratic

assignment problems. Naval Research Logistics Quarterly 18:1-36. Planchart, A., and A. Hurter, Jr. 1975. An efficient algorithm for the solution of

the Weber problem with mixed norms. SIAM Journal of Control 13:650-665. Plane, D. R., and T. E. Hendrick. 1977. Mathematical programming and the

location of fire companies for the Denver Fire Department. Operations Research 25:563-578.

Pritsker, A. A. ., and P. M. Ghare. 1970. Locating new facilities with respect to existing facilities. AIIE Transactions 2:290-297. Errata and revisions in AIIE Transactions 1971; 3:158-159.

Rao, M. R. 1973. On the direct search approach to the rectilinear facilities location problem. AIIE Transactions 5:256-264.

J. 1 uat-ivuudiu wiiiiig : A piaccmeni aigoHthm. SIAM Review 3:37-50.

Sylvester, J. J. 1857. A question in the geometry of the situation. Quarterly Journal of Pure and Applied Mathematics 1:79.

-. 1860. On Poncelets approximate linear valuation of surd forms. Philosophical Magazine 20/Fourth Series:203-222.

Thisse, J. F., J. E. Ward, and R. E. Wendell. 1984. Some properties of location problems with block and round norms. Operations Research 32:1309-1327.

Toregas, C, and C. ReVelle. 1973. Binary logic solutions to a class of location problems. Geographical Analysis 5:145-155.

Toregas, C, R. Swain, C. ReVelle, and L. Bergman. 1971. The location of emergency service facilities. Operations Research 19:1363-1373.

Urquhart, M. 1977. Pipe fabrication shop layout. Undergraduate Thesis, Department of Mechanical Engineering, University of Waterloo, Spring Semester.

Van Roy, T. J., and D. Erlenkotter. 1982. Dual-based procedure for dynamic facihty location. Management Science 28:1091-1105.

Vergin, R. C, and J. D. Rogers. 1967. An algorithm and computational procedure for locating economic facilities. Management Science 13:256-264.

Walker, W. 1974. Using the set-covering problem to assign fire companies to fire houses. Operations Research 22:275-277.

Walker, W., J. M. Chaiken, and E. J. IgnaU, eds. 1980. Fire department deployment analysis: A public policy analysis case study. New York: Elsevier/Nonh-Hol-land.