## Keywords

Facility Location Lagrangian Relaxation Demand Point Nondominated Solution Demand Node
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## References

- Ahituv, N.; Berman, O. (1988).
*Operations Management of Distributed Service Networks: A Practical Quantitative Approach*, Plenum Press, New York.MATHGoogle Scholar - Aykin, T. C. (1988). "On the location of hub facilities."
*Transportation Sciences*, Vol. 22, pp. 155–157.MATHMathSciNetGoogle Scholar - Batta, R.; Palekar, U. (1988). "Mixed planar/network facility location problems."
*Computers and Operations Research*, Vol. 15, pp. 61–67.MathSciNetMATHGoogle Scholar - Beasley, J. E. (1990). "Lagrangian heuristics for location problems." working paper, The Management School, Imperial College, University of London, London, England.Google Scholar
- Berlin, G. N.; ReVelle, C. S.; Elzinga, D. J. (1976). "Determining ambulance-hospital locations for on-scene and hospital services."
*Environment and Planning A*, Vol. 8, pp. 553–561.Google Scholar - Berman, O.; Simchi-Levi, D.; Tamur, A. (1988). "The minimax multistop location problem on a tree."
*Networks*, Vol. 18, pp. 39–10.MathSciNetMATHGoogle Scholar - Brandeau, M. L.; Chiu, S. S. (1991). "Parametric analysis of optimal facility locations." Networks, Vol. 21, pp. 223–243.MathSciNetMATHGoogle Scholar
- Chan, Y. (2000).
*Location Theory and Decision Analysis*, ITP/South-Western/Cincinnati, Ohio.Google Scholar - Chen, R. (1988). "Conditional minimum and minimax location-allocation problems in Euclidean space."
*Transportation Science*, Vol. 22, pp. 157–160.MathSciNetGoogle Scholar - Chhajed, D; Lowe, T. J. (1992). "m-median and m-center problems with mutual communication: solvable special cases."
*Operations Research*, Vol. 40, pp. S56–S66.MathSciNetGoogle Scholar - Church, R.; ReVelle, C. S. (1976). "Theoretical and computational links between the
*p*-median, location set covering and the maximal covering location problem."*Geographical Analysis*, Vol. 8, pp. 406–415.CrossRefGoogle Scholar - Cohon, J. L.; Eagles, T. W.; Margalies, T. S.; ReVelle, C. S. (1982). "Population/cost tradeoffs for nuclear reactor siting policies." Operations Research Group Report Series Paper #81-04, Dept. of Geography and Environmental Engineering, The Johns Hopkins University, Baltimore, Maryland.Google Scholar
- Colorni, A. (1987). "Optimization techniques in locational modelling." in
*Urban Systems Contemporary Approaches to Modelling*(edited by O.S. Bertuglia et al.), Croom-Helm, Kent, Great Britain.Google Scholar - da Conceicao Cunha, M.; Pais Antunes, A. (1997) "On the efficient location of pumping facilities in an aquifer system."
*International Transactions in Operational Research*, Vol. 4, No. 3, pp. 175–184.MATHGoogle Scholar - Daskin, M. (1995).
*Network and Discrete Location: Models, Algorithms and Applications*, Wiley-InterScience, New York, New York.MATHGoogle Scholar - de Matta, R.; Hsu, V. N; Love, T. J. (1999) "The selection allocation problem."
*Naval Research Logistics*, Vol. 46, pp. 707–725.MathSciNetMATHGoogle Scholar - Drezner, Z.; Gravish, B. (1985). "ε-approximation for multidimensional weighted location problems."
*Operations Research*, Vol. 33, pp. 772–782.MathSciNetMATHGoogle Scholar - Drezner, Z. — editor (1995).
*Facility Location: A Survey of Applications and Methods*, Springer-Verlag, New York, New York.Google Scholar - Eiselt, H. A. (1992). "Location modeling in practice."
*American Journal of Mathematical and Management Sciences*, Vol. 12, No. 1, pp. 3–8.Google Scholar - Engberg, D.; Linke, E.; Cohon, J.; ReVelle, C. S. (1982). "Siting an offshore natural gas pipeline using a mathematical model."
*National Development*, June/July, pp. 93–100.Google Scholar - Erkut, E.; Francis, R.; Lowe, T.; Tamir, A. (1987). "Equivalent mathematical programming formulations of monotonic tree network location problem." working paper, Dept. of Finance and Management Science, University of Alberta, Edmonton, Canada.Google Scholar
- Evans, J.; Minieka, E. (1992).
*Optimization Algorithms for Networks and Graphs*, Dekker.Google Scholar - Francis, R. L.; Lowe, T. J. (1990). "On the worst-case aggregation analysis for network location problems." Research Report No. 90-13, Industrial and Systems Engineering Department, University of Florida, Gainesville, Florida.Google Scholar
- Francis, R. L.; Lowe, T. J.; Tamir, A. (2001). "Worst-case incremental analysis for a class of
*p*-facility location models." Working Paper, Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida.Google Scholar - Francis, R. L.; McGinnis, L. F.; White, J. A. (1999).
*Facility lay out and location: An analytical approach*, 3rd Edition, Prentice Hall, Upper Saddle River, New Jersey.Google Scholar - Francis, R.; McGinnis, L.; and White, J. (1983). "Locational analysis."
*European Journal of Operations Research*, Vol. 12, pp. 220–252.MathSciNetMATHGoogle Scholar - Galvao, R. D. (1993). "The use of Lagrangian relaxation in the solution of uncapacitated facility location problems."
*Location Science*, Vol. 1, pp. 57–79.MATHGoogle Scholar - Ghosh, A.; Harche, F. (1993). "Location-allocation models in the private sector: progress, problems, and prospects."
*Location Science*, Vol. 1, pp. 81–106.MATHGoogle Scholar - Goldman, A. J. (1972). "Approximate localization theorems for optimal facility placement."
*Transportation Science*, Vol. 6, pp. 195–201.MathSciNetGoogle Scholar - Hakimi, S L; Labbe, M; Schmeichel, E F (1994). "Locations on time-varying networks." Discussion paper 94/05, Service de Mathematiques de la Gestion, Universite Libre de Bruxelles, Brussels, Belgium.Google Scholar
- Hakimi, S. L. (1964). "Optimal location of switching centers and the absolute center and the medians of a graph." Operations Research, Vol. 12, pp. 450–459.Google Scholar
- Hakimi, S. L.; Kuo, C-C (1988). "On a general network location-production-allocation problem." working paper, Dept. of Electrical Engineering and Computer Science, University of California at Davis, Davis, California.Google Scholar
- Handler, G. Y.; Mirchandani, P. B. (1979).
*Location on Networks*: Theory and Algorithms, MIT Press, Cambridge, Massachusetts.MATHGoogle Scholar - Hansen, P.; Thisse, J-F; Wendall, R. (1986). "Equivalence of solutions to network location problems."
*Mathematics of Operations*Research, Vol. 11, pp. 672–678.MathSciNetMATHGoogle Scholar - Hansen, P.; Peeters, D.; Richard, D.; Thisse, J. F. (1985). "The minisum and minimax location problems revisited."
*Operations Research*, Vol. 33, no. 6, pp. 1251–1265.MathSciNetMATHGoogle Scholar - Hansen, P.; Labbe, M.; Thisse, J-F. (1990). "From the median to the generalized center." working paper, GERAD, Ecole des Hautes Etudes Commerciales, Montreal, Canada.Google Scholar
- Hockbaum, D. (1984). "When are NP-hard location problems easy?"
*Annals of Operations Research*, Vol. 1, pp. 201–214.Google Scholar - Hooker, J.N. (1989). "Solving nonlinear multiple-facility network location problems." Networks, Vol. 19, pp. 117–133.MATHMathSciNetGoogle Scholar
- Hurter, A. P.; Martinich, J. S. (1989).
*Facility location and the theory of production*, Kluwer Academic Publishers.Google Scholar - Kara, B. Y. (1999). "Modeling and Analysis of Issues in Hub Location Problem." Doctoral Dissertation, Department of Industrial Engineering, Balkent University, Ankara, Turkey.Google Scholar
- Keeney, R. L. (1980).
*Siting Energy Facilities*, Academic Press.Google Scholar - Krarup, J.; Pruzan, P. M. (1981). "Reducibility of minimax to minisum 0–1 programming problems."
*European Journal of Operational Research*, Vol. 6, pp. 125–132.MathSciNetMATHGoogle Scholar - Krarup, J.; Pruzan, P. M. (1990). "Ingredients of locational analysis." in
*Discrete Location Theory*(edited by P. B. Mirchandani and R. L. Francis), Wiley-Interscience, New York, New York, pp. 1–54.Google Scholar - Levin, Y.; Ben-Israel, A. (2001). "A heuristic method for large-scale multifacilty location problems." Working Paper, Rutcor, Rutgers University, New Brunswick, New Jersey.Google Scholar
- Love, R. F.; Morris, J. G.; Wesolowsky, G. O. (1988).
*Facility Location: Models and Methods*. North Holland, New York, New York.Google Scholar - Marks, D. H.; ReVelle, C; Liebman, J. (1970). "Mathematical models of location: a review."
*Journal of the ASCE Urban Planning and Development Division*, Vol. 96, No. UP1, pp. 81–93.Google Scholar - Marsh, M. T.; Schilling, D. A. (1994). "Equity measurement in facility location analysis: a review and framework."
*European Journal of Operational Research*, Vol. 74, pp. 1–17.MATHGoogle Scholar - Minieka, E. (1985). "The optimal location of a path or tree in a tree network."
*Networks*, Vol. 15, pp. 309–321.MATHMathSciNetGoogle Scholar - Mirchandani, P. (1987). "Generalized hierarchical facility locations."
*Transportation Science*, Vol. 21, pp. 123–125.MathSciNetGoogle Scholar - Mirchandani, P. B.; Francis, R. L. — Editors (1990).
*Discrete Location Theory*, Wiley-Interscience, New York, New York.MATHGoogle Scholar - Moon, I. D.; Chaudhry, S. S. (1984). "An analysis of network location problems with distance constraints."
*Management Science*, Vol. 30, pp. 290–307.MATHGoogle Scholar - Moore, K.; Chan, Y. (1990). "Integrated location-and-routing models: Model examples." Working paper, Dept. of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
- Mouchahoir, G. E. (1983). "Regional cargo transportation center: definition of concept and optimal network."
*Transportation Quarterly*, Vol. 37, No. 3, pp. 355–377.Google Scholar - ReVelle, C; Church, R.; Schilling, D. (1975). "A note on the location model of Holmes, Williams and Brown."
*Papers of the Regional Science Association*, Vol. 7, No. 4.Google Scholar - ReVelle, C; Marks, D.; Liebman, J. C. (1970). "An analysis of private and public sector location models."
*Management Science*, Vol. 15, No. 11, pp. 692–707.Google Scholar - ReVelle, C. (1991). "Siting ambulances and fire companies: new tools for planners."
*Journal of the American Planning Association*, Vol. 57, No. 4, pp. 471–484.Google Scholar - Rojeski, P.; ReVelle, C. (1972). "Central facilities location under an investment constraint."
*Geographical Analysis*, Vol. 2, pp. 343–360.CrossRefGoogle Scholar - Rushton, G. (1989). "Applications of location models."
*Annals of Operations Research*, Vol. 18, pp. 25–42.MathSciNetGoogle Scholar - Schilling, D. A., Jayaraman, V.; Barkhi, R. (1993). "A review of covering problems in facility location."
*Location Science*, Vol. 1, pp. 25–55.MATHGoogle Scholar - Scott, A. J. (1971).
*Combinatorial programming, spatial analysis and planning*, Methuen, London.Google Scholar - “S-Distance: A Spatial Decision Support System.” (www.prd.uth.gr/res_labs/spatial_analysis/software) Laboratory of Spatial Analysis, GIS and Thematic Mapping, Department of Planning and Regional Development, University of Thessaly, Greece.Google Scholar
- Sule, D. R. (1988).
*Manufacturing Facilities: Location, Planning and Design*, Second Edition, ITP/PWS, Boston, Massachusetts.Google Scholar - Swain, R. W. (1974). "A parametric decomposition approach for the solution of uncapacitated location problems."
*Management Science*, Vol. 21, No. 2, pp. 189–198.MATHGoogle Scholar - Swink, M.; Robinson, E. P. (1990). "Reason based solutions and the complexity of distribution network design problems." Working paper, Operations Management Department, School of Business, Indiana University, Bloomington, Indiana.Google Scholar
- Tamir, A. (1992). "On the complexity of some classes of location problems."
*Transportation Science*, Vol. 26, No. 4, pp. 352–354.MATHGoogle Scholar - Tamir, A.; Perez-Brito, D.; Moreno-Perez, J. A. (1998) "A polynomial algorithm for the
*p*-centdian problem on a tree."*Networks*, Vol. 32, pp. 255–262.MathSciNetMATHGoogle Scholar - Taniguchi, E.; Noritake, M.; Yamada, T.; Izumitani, T. (1999) "Optimal size and location planning of public logistics terminals."
*Transportation Research-E*, Vol. 35, pp. 207–222.Google Scholar - Tansel, B.; Francis, R.; Lowe, T. (1983). "Location on networks: A survey—Parts I and II."
*Management Science*, Vol. 29, No. 4, pp. 482–511.MathSciNetMATHGoogle Scholar - Ting, S. S. (1984). "A linear-time algorithm for maxisum facility location on tree networks."
*Transportation Science*, Vol. 18, pp. 76–84.MathSciNetGoogle Scholar - Toregas, C. (1971). "Location under maximal travel time constraints." Ph.D. thesis, Cornell University, Ithaca, New York.Google Scholar
- Toregas, C; ReVelle, C. (1972). "Optimal location under time or distance constraints."
*Regional Science Association Papers*, Vol. 28, pp. 133–143.CrossRefGoogle Scholar - Toregas, C; ReVelle, C. (1973). "Binary logic solution to a class of location problem."
*Geographical Analysis*, Vol. 5, pp. 145–155.CrossRefGoogle Scholar - Toregas, C; Swain, R.; ReVelle, C. S.; Bergman, L. (1971). "The location of emergency service facilities."
*Operations Research*, Vol. 19, No. 5, pp. 1363–1373.MATHGoogle Scholar *Transportation Science*, Vol. 28, No. 2 (1994). Focus issue on "Location Models and Algorithms".Google Scholar- Verter, V.; Dincer, M. C. (1994). "Facility location and capacity acquisition: an integrated approach." Research Report No. 94-2, Department of Finance and Management Science, University of Alberta, Edmonton, Alberta.Google Scholar
- Xu, N.; Lowe, T. J. (1993). "On the equivalence of dual methods for two location problems."
*Transportation Science*, Vol. 27, pp. 194–199.MathSciNetMATHGoogle Scholar - Bartezzaghi, E.; Colorni, A.; Palermo, P. C. (1981). "A search tree algorithm for plant location problems."
*European Journal for Operations Research*, Vol. 7, pp. 371–379.MathSciNetMATHGoogle Scholar - Cabot, A. V.; Erenguc, S. S. (1984). "Some branch-and-bound procedures for fixed cost transportation problems."
*Naval Research Logistics*, Vol. 31, pp. 145–154MathSciNetMATHGoogle Scholar - Dearing, P. M.; Hammer, P. L.; Simeone, B. (1992). "Boolean and graph theoretic formulations of the simple plant location problem."
*Transportation Science*, Vol. 26, pp. 138–148.MATHGoogle Scholar - Erlenkotter, D. (1978). "A dual-based procedure for uncapacitated facility location."
*Operations Research*, Vol. 26, No. 6, pp. 992–1009.MATHMathSciNetGoogle Scholar - Gao, L-L.; Robinson, E. P. (1994). "Uncapacitated facility location: general solution procedure and computational experience."
*European Journal of Operational Research*, Vol. 76, pp. 410–427.MATHGoogle Scholar - Hanjoul, P.; Hansen, P.; Peeters, D.; Thisse, J.F. (1990). "Uncapacitated plant location under alternative spatial price policies."
*Management Science*, Vol. 36, No. 1, pp. 41–57.MathSciNetMATHGoogle Scholar - Holmberg, K.; Jornsten, K. (1996). "Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction."
*Location Science*, Vol. 4, pp. 83–100.MATHGoogle Scholar - Kennington, J.; Unger, E. (1976). "A new branch and bound algorithm for the fixed-charge transportation problem."
*Management Science*, Vol. 22, pp. 1116–1126.MathSciNetMATHGoogle Scholar - Khumawala, B. M. (1972). "An efficient branch and bound algorithm for the warehouse location problem."
*Management Science*, Vol. 18, No. 12, pp. 718–731.Google Scholar - Klincewicz, J.G. (1990). "Solving a freight transport problem using facility location techniques."
*Operations Research*, Vol. 38, No. 1, pp. 99–109.MATHGoogle Scholar - Klincewicz, J.; Luss, H. (1987). "A dual-based algorithm for multiproduct uncapacitated facility location."
*Transportation Science*, Vol. 21, No. 3, pp. 198–206.MATHGoogle Scholar - Louveaux, F. V.; Peeters, D. (1992). "A dual-based procedure for stochastic facility location."
*Operations Research*, Vol. 40, No. 3, pp. 564–573.MathSciNetMATHGoogle Scholar - Monticone, L. C; Funk, G. (1994). "Application of the facility location problem to the problem of locating concentrators on an FAA microwave system."
*Annals of Operations Research*, Vol. 50, pp. 437–4154.MATHGoogle Scholar - Piersma, N. (1992). "Almost sure convergence of the capacitated facility location problem." working paper, Econometric Institute, Erasma University, Rotterdam, Netherlands.Google Scholar
- ReVelle, C. S.; Laporte, G. (1996). "The plant location problem: new models and research prospects."
*Operations Research*, Vol. 44, pp. 864–874.MATHGoogle Scholar - Sankaran, J. K.; Raghavan, N. R. S. (1996). “Locating and sizing plants to bottle propane in South India.” Working paper, Department of Management Science an Information Systems, University of Auckland, Auckland, New Zealand, 19 pp.Google Scholar
- Sherali, H. D.; Ramchandran, S; Kim, S-I. (1991). "A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem." working paper, Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia.Google Scholar
- Sherali, H. D.; Tuncbilek, C.H. (1992). "A squared-Euclidean distance location-allocation problem."
*Naval Research Logistics*, Vol. 39, pp. 447–469.MathSciNetMATHGoogle Scholar - Verter, V.; Dincer, M. C. (1992). "An integrated evaluation of facility location, capacity acquisition, and technology selection for designing global manufacturing strategies."
*European Journal of Operational Research*, Vol. 60, pp. 1–18.MATHGoogle Scholar - Zhu, Z. P.; ReVelle, C; Rosing, K. (1989). "Adaptation of the plant location model for regional environmental facilities and cost allocation strategy."
*Annals of Operations Research*, Vol. 18, pp. 345–366.MathSciNetGoogle Scholar - Allen, W. R. (1995). "An improved bound for the multifacility location model."
*Operations Research*Letters, Vol. 17, pp. 175–180.MATHMathSciNetGoogle Scholar - Brimberg, J.; Love, R. F. (1993). "Global convergence of a generalized iterative procedure for the minisum location problem with
*l*_{p}distances."*Operations Research*, Vol. 41, pp. 1153–1163.MathSciNetMATHGoogle Scholar - Brimberg, J.; Chen, R.; Chen, D. (1998) "Accelerating convergence in the Fermat-Weber location problem."
*Operations Research*Letters, Vol. 22, pp. 151–157.MathSciNetMATHGoogle Scholar - Chen, P-C; Hansen, P.; Jaumard, B.; Tuy, H. (1998). "Solution of the multi-facility Weber and conditional Weber problems by d.-c. programming."
*Operations Research*, Vol. 46, No. 4, pp. 548–562.MathSciNetMATHGoogle Scholar - Chen, P-C; Hansen, P.; Jaumard, B.; Tuy, H. (1992). "Weber's problem with attraction and repulsion." RUTCOR research report 13-92, State University of New Jersey, New Brunswick, New Jersey.Google Scholar
- Drezner, Z.; Goldman, A. J. (1991). "On the set of optimal points to the Weber problem."
*Transportation Science*, Vol. 25, No. 1, pp. 3–8.MathSciNetMATHGoogle Scholar - Drezner, Z.; Wesolowsky, G. O. (1983). "Location of an obnoxious facility with rectangular distances."
*Journal of Regional Science*, Vol. 23, pp. 241–248.Google Scholar - Gamal, M. D. H.; Salhi, S. (2003). “A cellular heuristic for the mutisource Weber problem.”
*Computers & Operations Research*, Vol. 30, Issue 11, pp. 1609–1624.MathSciNetMATHGoogle Scholar - Hansen, P.; Mladenovic, N; Taillard, E. (1998) "Heuristic solution of the multisource Weber problem as a
*p*-median problem."*Operations Research Letters*, Vol. 22, pp. 55–62.MathSciNetMATHGoogle Scholar - Huang, S.; Batta, R.; Klamroth, K.; Nagi, R. (2002). “
*K*-connection location problem in a plane.” Working Paper, Department of Industrial Engineering, University of Buffalo, Buffalo, New York.Google Scholar - Hurry, D.; Farmer, R.; Chan, Y. (1995). "Airport-Location-Problem: Comparison of algorithms." Working paper, Dept. of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
- Juel, H.; Love, R. F. (1986). "A geometrical interpretation of the existing facility solution condition for the Weber problem."
*Journal of the Operational Research Society*, Vol. 37, No. 12, pp. 1129–1131.MATHGoogle Scholar - Klamroth, K.; Wiecek, M. M. (1997) "A multiple objective planar location problem with a line barrier." Working Paper, University of Kaiserslautern, Kaiserslautern, Germany.Google Scholar
- Mehrez, A.; Sinuany-Stern, Z.; Stulman, A. (1986). "An enhancement of the Drezner-Wesolowsky algorithm for single-facility location with maximin of rectilinear distance."
*Journal of the Operational Research Society*, Vol. 37, pp. 971–977.MATHGoogle Scholar - Melachrinoudis, E.; Xanthopulos, Z. (2001). “The Euclidean distance single facility location problem with the minisum and maximin objectives.” Working Paper, Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, Boston, Massachusetts.Google Scholar
- Ohsawa, Y.; Imai, A. (1997). "Degree of locational freedom in a single facility Euclidean minimax location model."
*Location Science*, Vol. 5, No. 1, pp. 29–45.MATHGoogle Scholar - Rado, F. (1988). "The Euclidean multifacility location problem."
*Operations Research*, Vol. 36, pp. 485–492.MATHMathSciNetGoogle Scholar - Rosen, J. B.; Xue, G. L. (1993). "On the convergence of a hyperboloid approximation procedure for the perturbed Euclidean multifacility location problem."
*Operations Research*, Vol. 41, pp. 1164–1171.MathSciNetMATHGoogle Scholar - Sherali, H. D.; Tuncbilek, C. H. (1992). "A squared-Euclidean distance location-allocation problem."
*Naval Research Logistics*, Vol. 39, pp. 447–469.MathSciNetMATHGoogle Scholar - Wang, C; Gao, C; Shi, Z. (1997) "An algorithm for continuous type optimal location problem."
*Computational Optimization and Applications*, Vol. 7, pp. 239–253.MathSciNetMATHGoogle Scholar - Wesolowsky, G. O. (1993). "The Weber problem: history and perspectives."
*Location Science*, Vol. 1, pp. 5–23.MATHGoogle Scholar - Batta, R.; Mannur, N. R. (1990). "Covering-location models for emergency situations that require multiple response units."
*Management Science*, Vol. 36, No. 1, pp. 16–23.MathSciNetMATHGoogle Scholar - Berman, O.; Simchi-Levi, D. (1990). "Conditional location problems on networks."
*Transportation Science*, Vol. 24, No. 1, pp. 77–78.MathSciNetMATHGoogle Scholar - Butt, S. E.; Cavalier, T. M. (1997). "Facility location in the presence of congested regions with the rectilinear distance metric."
*Socio-Economic Planning Sciences*, Vol. 31, No. 2, pp. 103–113.Google Scholar - Campbell, J. F. (1996). "Hub location and the
*p*-hub median problem."*Operations Research*, Vol. 44, pp. 923–935.MATHMathSciNetGoogle Scholar - Chaudhry, S. S.; Choi, I. C. (1995). "Facility location with and without maximum distance constraints through the
*p*-median problem."*International Journal of Operations and Production Management*, Vol. 15, No. 10.Google Scholar - Chhajed, D.; Lowe, T. J. (1992). "M-median and M-center problems with mutual communication: solvable special cases."
*Operations Research*, Vol. 40, pp. 56–66.MathSciNetGoogle Scholar - Chhajed, D.; Lowe, T. J. (1998). "Solving a selected class of location problems by exploiting problem structure: a decomposition approach."
*Naval Research Logistics*, Vol. 45, pp. 791–815.MathSciNetMATHGoogle Scholar - Choi, I-C.; Chaudhry, S. S. (1992). "The
*p*-median problem with maximum distance constraints: a direct approach." working paper, Department of Industrial Engineering, Wichita State University, Wichita, Kansas.Google Scholar - Choi, I-C; Chaudhry, S. S. (1993). "The
*p*-median problem with maximum distance constraints: a direct approach."*Location Science*, Vol. l, pp. 235–243.Google Scholar - Drezner, Z. (1995). "On the conditional
*p*-median problem."*Computers and Operations Research*, Vol. 22, pp. 525–530.MATHGoogle Scholar - Francis, R. L.; Lowe, T. J.; Rayco, M. B. (1993). "Row-column aggregation of rectilinear distance
*p*-median problems." Research Report 93-5, Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida.Google Scholar - Hansen, P.; Labbe, M. (1989). "The continuous
*p*-median of a network."*Networks*, Vol. 19, pp. 595–606.MathSciNetMATHGoogle Scholar - Hribar, M; Daskin, M. S. (forthcoming). "A dynamic programming heuristic of the
*p*-median problem."*European Journal of Operational Research*.Google Scholar - Hsu, V. N.; Lowe, T. J.; Tamir, A. (1997) "Structured
*p*-facility location problems on the line solvable in polynomial time."*Operations Research Letters*, Vol. 21, pp. 159–164.MathSciNetMATHGoogle Scholar - Lefebvre, O.; Michelot, C; Plastria, F. (1991). "Sufficient conditions for coincidence in minisum multifacility location problems with a general metric."
*Operations Research*, Vol. 39, No. 3, p. 437–442.MathSciNetMATHGoogle Scholar - Louveaux, F.(1986). "Discrete stochastic location models."
*Annals of Operations Research*, Vol. 6, Baltzer, pp. 23–34.Google Scholar - Mirchandani, P. B. (1990). "The
*p*-median problem and generalizations." in*Discrete Location Theory*(edited by P. B. Mirchandani and R. L. Francis), Wiley, New York, New York, pp. 55–118.Google Scholar - Mirchandani, P. B.; Odoni, A. R. (1979). "Location of medians on stochastic networks."
*Transportation Science*, Vol. 13, pp. 85–97.MathSciNetGoogle Scholar - Sheraldi, H.; and Adams, W. (1984). "A decomposition algorithm for a discrete location-allocation problem."
*Operations Research*, Vol. 32, No. 4, pp. 878–900.Google Scholar - Syam, S. S. (1997). "A model for the capacitated
*p*-facility location problem in global environments."*Computers & Operations Research*, Vol. 11, No. 11, pp. 1005–1016.MATHMathSciNetGoogle Scholar - Watson-Grandy, C. (1985). "The solution of distance constrained mini-sum location problems."
*Operations Research*, Vol. 33, No. 4, pp. 784–802.MathSciNetGoogle Scholar - Xue, G. L.; Rosen, J. B.; Pardalos, P. M. (1996) "A polynomial time dual algorithm for the Euclidean multifacility location problem."
*Operations Research Letters*, Vol. 18, pp. 201–204.MathSciNetMATHGoogle Scholar - Aytug, H.; Saydam, C. (2002). “Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study.”
*European Journal of Operational Research*, Vol. 141, pp. 480–494.MathSciNetMATHGoogle Scholar - Ball, M. O.; Lin, F. L. (1995). "Reliability, covering and balanced matrices."
*Operations Research Letters*, Vol. 17, pp. 1–7.MathSciNetMATHGoogle Scholar - Batta, R.; Dolan, J. M.; Krishnamurthy, N. N. (1989). "The maximal expected covering location problem: revisited."
*Transportation Science*, Vol. 23, pp. 277–287.MathSciNetMATHGoogle Scholar - Batta, R; Mannur, N.R. (1990). "Covering-Location Models for emergency situations that require multiple response units."
*Management Science*, Vol. 36. pp. 16–23.MathSciNetMATHGoogle Scholar - Berman, O. (1992). "The
*p*maximal cover-*p*partial center problem on networks." working paper, Dept. of Management at Scarborough." University of Toronto, Toronto, Ontario, Canada.Google Scholar - Berman, O.; Drezner, Z.; Wesolowsky, G. O. (2003). “Locating service facilities whose reliability is distance dependant.”
*Computers & Operations Research*, Vol. 30, Issue 11, pp. 1683–1695.MathSciNetMATHGoogle Scholar - Chaudhry, S. S. (1993). "New heuristics for the conditional covering problem."
*Opsearch*, Vol. 30, pp. 42–47 (Operational Research Society of India).MATHGoogle Scholar - Chaudhry, S. S.; Moon, I. D.; McCormick, S. T. (1987). "Conditional covering: Greedy heuristics and computational results."
*Computers and Operations Research*, Vol. 14, pp. 1–18.MathSciNetGoogle Scholar - Chaudhry, S. S.; McCormick, S. T.; Moon, I. D. (1987). "Locating independent facilities with maximum weight: Greedy heuristics."
*OMEGA*, Vol. 14, pp. 383–389.MathSciNetGoogle Scholar - Church, R.; ReVelle, C. S. (1974). "The maximal covering location problem."
*Papers of the Regional Science Association*, Vol. 32, pp. 101–117.Google Scholar - Daskin, M.; Hogan, K.; ReVelle, C. (1988). "Integration of multiple, excess, backup and expected covering models."
*Environment and Planning B.*, Vol. 15, pp. 15–35.Google Scholar - Daskin, M. (1983). "A maximum expected covering location model: formulation, properties and heuristic solution."
*Transportation Science*, Vol. 17, pp. 48–70.Google Scholar - Gentili, M.; Mirchandani, P. B. (2004). “Locating active sensors on traffic networks.” Working Paper, Computing Science Department, University of Salerno, Baronissi, Italy.Google Scholar
- Hogan, K.; ReVelle, C. (1986). "Concepts and applications of backup coverage."
*Management Science*, Vol. 32, pp. 1434–1444.Google Scholar - Hutson, V. A.; ReVelle, C. S. (1989). "Maximal direct covering tree problems."
*Transportation Science*, Vol. 23, pp. 288–299.MathSciNetMATHGoogle Scholar - Lin, J-J.; Feng, C-C. (2002). “A location design model for land uses, network and facilities in urban planning.” Working Paper, Graduate Institute of Urban Planning, National Taipei University, Taipei, Taiwan.Google Scholar
- Marianov, V.; ReVelle, C. (1994). "The queuing probabilistic location set covering problem and some extensions."
*Socio-Economic Planning Sciences*, Vol. 28, pp. 167–178.Google Scholar - Martin, P. E. (1999) "A Multi-Service Location-Allocation Model for Military Recruiting." Master's Thesis, Code: SM/GK, Naval Postgraduate School, Monterey, California.Google Scholar
- Mehrez, A.; Eben-Chaime, M.; Brimberg, J. (1996). "Locational analyses of military intelligence ground facilities." Working paper, Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer Sheva, Israel.Google Scholar
- Moore, G.; ReVelle, C. (1982). "The hierarchical service location problem."
*Management Science*, Vol. 28, pp. 775–780.MATHGoogle Scholar - ReVelle, C.; Hogan, K. (1989). "The maximum availability location problem."
*Transportation Science*, Vol. 23, pp. 192–199.MathSciNetMATHGoogle Scholar - ReVelle, C; Moore, G. C. (1982). "Hierarchical service location problem."
*Management Science*, Vol. 28, No. 7, pp. 775–780.MATHGoogle Scholar - Saccomanno, F. F.; Allen, B. (1988). "Locating emergency response capability for dangerous goods incidents on a road network."
*Transportation Research Record*, No. 1193, National Academy of Sciences, Washington, D.C., pp. 1–9.Google Scholar - Saydam, C; Aytug, H. (2003). “Accurate estimation of expected coverage: revisited.”
*Socio-Economic Planning Sciences*, Vol. 37, pp. 69–80.Google Scholar - Schick, W. G. (1992). "Locating an imaging radar in Canada for identifying space-borne objects." master's thesis, AFIT/GSO/ENS/92D-13, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
- Sheraldi, H.D.; Park, T. (2000). "Discrete equal-capacity;
*p*-median problem."*Naval Research Logistics*, Vol. 47, pp. 166–183.MathSciNetGoogle Scholar - Appa, G. M. (1993). "
*k*-integrality, an extension of total unimodularity."*Operations Research Letters*, Vol. 13, pp. 159–163.MATHMathSciNetGoogle Scholar - Averbakh, I.; Berman, O. (1997). "Minimax regret
*p*-center location on a network with demand uncertainty."*Location Science*, Vol. 5, No. 4, pp. 247–254.MATHGoogle Scholar - Berman, O.; Ingco, D. I.; Odoni, A. (1994). "Improving the location of minimax facilities through network modification."
*Networks*, Vol. 24, pp. 31–41.MathSciNetMATHGoogle Scholar - Berman, O. (1992). "The
*p*maximal cover-*p*partial center problem on networks." working paper, Dept. of Management at Scarborough, University of Toronto, Toronto, Ontario, Canada.Google Scholar - Berman, O.; Drezner, Z.; Wesolowsky, G. O. (1996). "Minimum covering criterion for obnoxious facility location on a network."
*Networks*, Vol. 28, pp. 1–5.MathSciNetMATHGoogle Scholar - Berman, O.; Simchi-Levi, D. (1990). "Conditional location problems on networks."
*Transportation Science*, Vol. 24, No. 1, pp. 77–78.MathSciNetMATHGoogle Scholar - Brimberg, J.; Juel, H. (1998) "On locating a semi-desirable facility on the continuous plane."
*International Transactions in Operational Research*, Vol. 5, No. 1, pp. 59–66.MATHGoogle Scholar - Chaudry, S. S.; Moon, I. G. (1987). "Analytical models for locating obnoxious facilities." in
*Hazardous Material Disposal: Siting and Management*, Edited by M Chatterji, Gower Publishing Co.Google Scholar - Chhajed, D..; Lowe, T. J. (1990). "M-median and M-center problems with mutual communication: solvable special case." Faculty working paper no. 90-1654, Bureau of Economic and Business Administration, University of Illinois, Urbana-Champaign, Illinois.Google Scholar
- Chen, M-L; Francis, R.; Lowe, T. (1988). "The l-center problem: Exploiting block structure."
*Transportation Science*, Vol. 22, p. 259–269.MathSciNetMATHGoogle Scholar - Church, R. L.; Garfinkel, R. S. (1978). "Locating an obnoxious facility on a network,"
*Transportation Science*, Vol. 12, pp. 107–118.MathSciNetGoogle Scholar - Daskin, M. (1995).
*Network and Discrete Location: Models, Algorithms and Applications*. Wiley-Interscience, New York, New York.MATHGoogle Scholar - Dasrathy, B.; White, L. J. (1980). “A maxmin location problem”
*Operations Research*, Vol. 28, pp. 1385–1401MathSciNetGoogle Scholar - Drezner, Z. (1989). "Conditional
*p*-center problem."*Transportation Science*, Vol. 23, pp. 51–53.MATHMathSciNetGoogle Scholar - Erkut, E.; Neuman, S. (1989). "Analytical models for locating undesirable facilities."
*European Journal of Operational Research*, Vol. 40, pp. 275–291.MathSciNetMATHGoogle Scholar - Francis, R. L.; Rayco, M. B. (1995). "Asymptotically Optimal Aggregation for Some Unweighted
*p*-Center Problems with Rectilinear Distances." Research Report 95-4, Department of Industrial & Systems Engineering, University of Florida, Gainesville, Florida.Google Scholar - Jaeger, M.; Goldberg, J. (1997). "Polynomial alogrithms for center location on spheres."
*Naval Research Logistics*, Vol. 44, pp. 341–352.MathSciNetMATHGoogle Scholar - Keysor, G.; Totten, C; Chan, Y. (1994). "Multi-criteria decision-making in locating p centers." Working paper, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
- Labbe, M. (1990). "Location of an obnoxious facility on a network: a voting approach."
*Networks*, Vol. 20, pp. 197–207.MATHMathSciNetGoogle Scholar - Melachrihoudis, E. (1988). "An efficient computational procedure for the recti-linear maximum location problem."
*Transportation Science*, Vol. 22, pp. 217–223.MathSciNetGoogle Scholar - Rayco, M. B.; Francis, R. L.; Lowe, T. J. (1995). "Error-Bound Driven Demand Point Aggregation for the Rectilinear Distance
*p*-Center Model." Research Report 95-9, Department of Industrial & Systems Engineering, University of Florida, Gainesville, Florida.Google Scholar - Rhee, W-S.T.; TaIagrand, M. (1989). "On the
*k*-center problem with many centers."*Operations Research Letters*, Vol. 8, pp. 309–314.MathSciNetMATHGoogle Scholar - Shier, D. R. (1977). “A max-min theorem for
*p*-center problems on a tree”*Transportation Science*, Vol. 11, pp. 243–252.Google Scholar - Sung, C. S.; Joo, C. M. (1994). "Locating an obnoxious facility on a Euclidean network to minimize neighborhood damage."
*Networks*, Vol. 24, pp. 1–9.MathSciNetMATHGoogle Scholar - Tansel, B. C, et al. (1982). “Duality and distance constraints for the non-linear
*p*-center problem and covering problem on a tree network”*Operations Research*, Vol. 30, pp. 725–744.MATHMathSciNetGoogle Scholar - Thomas, P.; Chan, Y. (1995). "Obnoxious facility location and the Data Envelopment Analysis." Master's Thesis. Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
- Tsay, H-S.; Lin, L-T. (1989). "Efficient algorithm for locating a new transportation facility in a network."
*Transportation Research Record*, No. 1251, pp. 35–44.Google Scholar - Woeginger, G. J. (1998). "A comment on a minimax location problem."
*Operations Research Letters*, Vol. 23, pp. 41–43.MATHMathSciNetGoogle Scholar - Badri, M. A.; Mortagy, A. K.; Alsayed, A. (1998) "A multi-objective model for locating fire stations."
*European Journal of Operational Research*, Vol. 110, pp. 243–260.MATHGoogle Scholar - Berman, O. (1990). "Mean-variance location problems."
*Transportation Science*, Vol. 24, No. 4, pp. 287–293.MATHMathSciNetGoogle Scholar - Bogardi, I.; Haden, R. J.; Zhang, L. (1999). "Facility location planning of street maintenance under conflicting objectives." Pre-print of the Annual Transportation Research Board Meeting, National Research Council, Washington, D.C.Google Scholar
- Carrizosa, E.; Conde, E.; Fernandez, F. R.; Puerto, J. (1993). "Efficiency in Euclidean constrained location problems."
*Operations Research Letters*, Vol. 14, pp. 291–295.MathSciNetMATHGoogle Scholar - Carrizosa, E.; Conde, E.; Munoz-Marquez; Puerto, J. (1995). "Planar point-objective location problems with no convex constraints: a geometrical construction."
*Journal of Global Optimization*, Vol. 6, pp 77–86.MathSciNetMATHGoogle Scholar - Carrizosa, E. J.; Puerto, J. (1995). "A discretizing algorithm for location problems."
*European Journal of Operational Research*, Vol. 80, pp. 166–174.MATHGoogle Scholar - Cohon, J. L.; ReVelle, C. S.; Current, J.; Eagles, T.; Eberhart, R.; Church, R. (1980). "Applications of a multiobjective facilities location model to power plant siting in a six-state region of the U.S."
*Computer and Operations Research*, Vol. 7, pp. 107–123.Google Scholar - Current, J.; Min, H.; Schilling, D. (1990). "Multiobjective analysis of facility location decisions."
*European Journal of Operational Research*, Vol. 49, pp. 295–307.MATHGoogle Scholar - Forgues, P. J. (1991). "The Optimal Location of GEODSS Sensors in Canada." Master's Thesis (AFIT/GSO/ENS/91M-1), Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFBGoogle Scholar
- Forgues, P.J.; Chan, Y.; Kellso, T. S. (1998). "A mean-variance location problem: a case study of siting satellite-tracking stations." Working paper. Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
- Hamacher, H. W.; Nickel, S. (1993). "Multi-criterial planar location problems." Working paper, University of Kaiserslautern, Germany.Google Scholar
- Hamacher, H. W.; Nickel, S. (1994). "Combinatorial algorithm for some 1-facility median problems in the plane."
*European Journal of Operational Research*, Vol. 79, pp. 340–351.MATHGoogle Scholar - Hooker, J. N.; Garfinkel, R. S.; Chen, C.K. (1991). "Finite dominating sets for network location problems."
*Operations Research*, Vol. 39, No. 1, pp. 100–118.MathSciNetMATHGoogle Scholar - Hutson, V. A.; ReVelle, C. S. (1989). "Maximal direct covering tree problems."
*Transportation Science*, Vol. 23, No. 4, pp. 288–299.MathSciNetMATHGoogle Scholar - Koksalan, M. M.; Sagely, P. N. S. (1995). "Interactive approaches for discrete alternative multiple criteria decision making with monotone utility functions."
*Management Science*, Vol. 41, pp. 1158–1171.Google Scholar - Kouvelis, P.; Carlson, R. C. (1992). "Total unimodularity application in bi-objective discrete optimization."
*Operations Research*Letters, Vol. 11, pp. 61–65.MathSciNetMATHGoogle Scholar - Malczewski, J.; Ogryczak, W. (1995). "The multiple criteria location problem: 1. A generalized network models and the set of efficient solutions."
*Environment and Planning A*, Vol. 27, pp. 1931–1960.Google Scholar - Malczewski, J.; Ogryczak, W. (1996). "The multiple criteria location problem: 2. Preference-based techniques and interactive decison support."
*Environment and Planning A*, Vol. 28, pp. 69–98.Google Scholar - Melachrinoudis, E.; Xanthopulos, Z. (1994). "A Euclidean distance single facility location problem with the minisum and maximin objectives." Working paper, Department of Industrial Engineering and Information Systems, Northeastern University, Boston, Massachusetts.Google Scholar
- ReVelle, C; Cohon, J.; Shobrys, D. (1981). "Multiple objectives in facility location: a review." Operations Research Group Report Series Paper #81-01, The John Hopkins University, Baltimore, Maryland.Google Scholar
- Ye, M-H.; Yezer, A. M. (1992). "Location and spatial pricing for public facilities."
*Journal of Regional Science*, Vol. 32, No. 2, pp. 143–154.Google Scholar - Ahuja, R. K.; Jha, K. C; Orlin, J. B.; Sharma, D. (2002). “Very large-scale neighborhood search for the quadratic assignment problem.” Working Paper, Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida.Google Scholar
- Batta, R.; Ghose, A.; Palekar, U. (1989). "Location facilities on the Manhattan metric with arbitrarily shaped barriers and convex forbidden regions."
*Transportation Science*, Vol. 23, pp. 26–36.MathSciNetMATHGoogle Scholar - Bazaraa, M. S.; Jarvis, J. J.; Sherali, H. D. (1990).
*Linear Programming and Network Flows*, Second Edition, Wiley, New York, New York.MATHGoogle Scholar - Berg, W.; Fair, T.; Chan, Y. (1996). "A k-medoid method approach to delineating line of sight radar degradation due to topography." Working paper. Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
- Berman, O.; Simchi-Levi, D. (1990). "Conditional location problems on networks."
*Transportation Science*, Vol. 24, pp. 77–78.MathSciNetCrossRefMATHGoogle Scholar - Berman, O.; Kaplan, E. H. (1990). "Equity maximizing facility location schemes."
*Transportation Science*, Vol. 24, No. 2, pp. 137–144.MathSciNetMATHGoogle Scholar - Brimberg, J.; Wesolowsky, G. O. (2000). "Note: Facility location with closest rectangular distances."
*Naval Research Logistics*, Vol. 47, pp. 77–84.MathSciNetMATHGoogle Scholar - Carreras, M; Serra, D. (1999) "On optimal location with threshold requirements."
*Socio-Economic Planning Sciences*, Vol. 33, pp. 91–103.Google Scholar - Chang, M. D.; Cheng, M-W.; Chen, C-H J. (1989). "Implementation of new labeling procedures for generalized networks." Working paper, Dept. of Computer Science and Operations Research, North Dakota State University, Fargo, North Dakota.Google Scholar
- Chardaire, P.; Sutter, A. (1996). "Solving the dynamic facility location problem."
*Networks*, Vol. 26, pp. 117–124.MathSciNetGoogle Scholar - Chepoi, V.; Dragan, F. F. (1996). "Condorcet and median points of simple rectilinear polygons."
*Location Science*, Vol. 4, pp. 21–35.MATHGoogle Scholar - Chhajed, D.; Lowe, T. J. (1990). "Locating facilities which interact: some solvable cases." Faculty working paper no. 90-1686, Bureau of Economic and Business Research, University of Illinois, Urbana-Champaign, Illinois.Google Scholar
- Current, J.; Weber, C. (1994). "Application of facility location modeling constructs to vendor selection problems."
*European Journal of Operational Research*, Vol. 76, pp. 387–392.MATHGoogle Scholar - Daskin, M. S.; Hopp, W. J.; Medina, B. (1992). "Forecast horizons and dynamic facility location planning."
*Annals of Operations Research*, Vol. 40, pp. 123–151.Google Scholar - Drezner, A.: Mehrez, A.; Weslowsky, G. O. (1991). "The facility location problem with limited distance."
*Transportation Science*, Vol. 25, No. 3, pp. 183–187.MATHGoogle Scholar - Eiselt, H. A.; Gendreau, M; Laporte, G. (1992). "Location of facilities on a network subject to a single-edge failure"
*Networks*, Vol. 22, pp. 231–246.MathSciNetMATHGoogle Scholar - Goldberg, A. V.; Tardos, E.; Tarjan, R. E. (1989). "Network Flow Algorithms." Dept. of Computer Science, Stanford University, Stanford, California.Google Scholar
- Goldberg, J.; Paz, L. (1990). "Locating emergency vehicle bases when service time depends on call location." working paper, Dept. of Systems and Industrial Engineering, University of Arizona, Tucson, Arizona.Google Scholar
- Hanjoul, P.; Hansen, P.; Peeters, D. (1990). "Uncapacitated plant location under alternative spatial price policies."
*Management Science*, Vol. 16, pp. 41–57.MathSciNetGoogle Scholar - Holmberg, K. (1994). "Solving the staircase cost facility location problem with decomposition and piecewise linearization."
*European Journal of Operational Research*, Vol. 75, pp. 41–61.MATHGoogle Scholar - Huang, G. H.; Baetz, B. W.; Patry G. (1993). "Grey Dynamic programming for waste management planning under uncertainty." Working paper, Department of Civil Engineering, McMaster University, Hamilton, Ontario, Canada.Google Scholar
- Jacobsen, S. K. (1990). "Multiperiod capacitated location models." in
*Discrete Facility Location*(Edited by P Mirchandani and R Francis), Wiley, New York, New York.Google Scholar - Jensen, P. (1985).
*MICROSOLVE Network Flow Programming, IBM-PC Student Version Software and User Manual*, Holden-Day, Oakland, California.Google Scholar - Jones, P. C; Lowe, T. J.; Muller, G.; Xu, N.; Ye Y.; Zydiak, J. L. (1995). "Specially structured uncapacitated facility location problems."
*Operations Research*, Vol. 43, pp. 661–669.MathSciNetMATHGoogle Scholar - Kara, B. Y.; Tansel, B. C. (2001). “The latest arrival hub location problem.”
*Management Science*, Vol. 47, No. 10, pp. 1408–1420.Google Scholar - Kaufman, L.; Rousseuw, P. J. (1990).
*Finding-Groups in Data: An Introduction to Cluster Analysis*, Wiley, New York, New York.Google Scholar - Kelso, T. S. (1990). Satellite pass scheduling software, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
- Klincewicz, J. G. (1990). "Solving a freight transport problem using facility location techniques."
*Operations Research*, Vol. 38, pp. 99–109.MATHGoogle Scholar - Labbe, M.; Schmeichel, E. F.; Hakimi, S. L. (1994). "Approximation algorithm for the capacitated plant allocation problem."
*Operations Research Letters*, Vol. 15, pp. 115–126.MathSciNetMATHGoogle Scholar - Larson, R. C; and Sadiq, G. (1983). "Facility locations with the Manhattan metric in the presence of barriers to travel,"
*Operations Research*, Vol. 31, No. 4, pp. 652–669.MathSciNetMATHGoogle Scholar - Lin, G-H.; Xue, G. (1998) "
*K*-center and*K*-median problems in graded distances."*Theoretical Computer Science*, Vol. 207, pp. 181–192.MathSciNetMATHGoogle Scholar - Loerch, A. G.; Boland, N.; Johnson, E. L.; Nemhauser, G. L. (1995). "Finding an optimal stationing policy for the US Army in Europe after the force drawdown." Working paper, US Army Concepts Analysis Agency, Bethesda, Maryland.Google Scholar
- Louwers, D.; Kip, B. J.; Peters, E.; Souren, F.; Flapper, S. D. P. (1999). "A facility location-allocation model for reusing arpet materials."
*Computers & Industrial Enineering*, Vol. 36, pp. 855–869.Google Scholar - Lucena, A.; Beasley, J. E. (1998). "A branch and cut algorithm for the Steiner problem in graphs."
*Networks*, Vol. 31, pp. 39–59.MathSciNetMATHGoogle Scholar - Magnanti, T. L.; Wong, R. T. (1990). "Decomposition methods for facility location problems." in
*Discrete Facility Location*, edited by P. B. Mirchandani and R. L. Francis, Wiley Interscience, New York, New York.Google Scholar - Marsh, M. T.; Schilling, D. A. (1994). "Equity measurement in facility location analysis: a review and framework."
*European Journal of Operational Research*, Vol. 74, pp. 1–17.MATHGoogle Scholar - Mavridou, T. D.; Pardalos, P. M. (1997) "Simulated annealing and genetic algorithms for the facility layout problem: a survey."
*Computational Optimization and Applications*, Vol. 7, pp. 111–126.MathSciNetMATHGoogle Scholar - McAleer, W. E.; Naqvi, I. A. (1994). "The relocation of ambulance stations: a successful case study."
*European Journal of Operational Research*, Vol. 75, pp. 582–588.Google Scholar - Min, H.; Melachrinoudis, E. (1997). "Dynamic expansion and location of an airport: a multiple objective approach."
*Transportation Research-A*, Vol. 31, No. 5, pp. 403–417.Google Scholar - Nel, L. D.; Colbourn, C. J. (1990). "Locating a broadcast facility in an unreliable network."
*1NFOR*, Vol. 28, No. 4, pp. 363–379.MATHGoogle Scholar - Nozick, L. K.; Turnquist, M. A. (1998) "Integrating inventory impacts into a fixed-charge models for locating distribution centersGoogle Scholar
- Nuworsoo, C. (1999). "A model to minimize non-revenue costs in bus transit operations." Pre-print of the Annual Transportation Research Board Meeting, National Research Council, Washington, D. C.Google Scholar
- Odoni, A. (1987). "Stochastic facility location problems." in
*Stochastics in combinatorial optimization*(G. Andreatta and F. Mason, editors), World Scientific, N.J.Google Scholar - Punnen, A. P. (1994). "On a combined minmax-minsum optimization."
*Computers and Operations Research*, Vol. 21, pp. 707–716.MATHGoogle Scholar - Sasaki, M.; Suzuki, A.; Drezner, Z. (1994). "On the selection of relay points in a logistics system." Working paper, Center for Management Studies, Nagoya, Japan.Google Scholar
- Schilling, D.; Elzinga, D. J.; Cohon, J.; Church, R.; ReVelle, C. S. (1979). "The team/fleet models for simultaneous facility and equipment siting."
*Transportation Science*, Vol. 13, May.Google Scholar - Serra de la Figuera, D.; ReVelle, C. (1993). "The
*pq*-median problem: location and distribution of hierarchical facilities."*Location Science*, Vol. 1, pp. 299–312.MATHGoogle Scholar - Serra de la Figuera, D.; ReVelle, C. (1994). "The pq-median problem: location and distribution of hierarchical facilities—II: Heuristic solution methods."
*Location Science*, Vol. 2 63–83.Google Scholar - Shulman, A. (1991). "An algorithm for solving dynamic capacitated plant location problems with discrete expansion sizes."
*Operations Research*, Vol. 39, No. 3, pp. 423–436.MATHMathSciNetGoogle Scholar - Spoonamore, J. H. (1996). "Solving a facility location problem using new optimization methods." Working paper, U S Army Construction Engineering Research Laboratory, P O Box 9005, Champaign, Illinois.Google Scholar
- Steppe, J.; Chan, Y.; Chrissis, J.; Marsh, F.; Drake, D. (1996). "A hierarchical maximal coverage location-allocation model: Case study of generalized search-and-rescue." Working paper. Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
- Steuer, R. E. (1986).
*Multicriteria optimization: Theory computation and application*, Wiley, New York, New York.Google Scholar - Skorin-Kapov, D.; Skorin-Kapov, J.; O'Kelly, M. (1994). "Tight linear programming relaxations of uncapacitated p-hub median problems." Working paper, Harriman School for Management and Policy, State university of New York, Stony Brook, New York.Google Scholar
- Xu, N.; Chhajed, D.; Lowe, T. J. (1994). "Tool design problems in a punch press flexible manufacturing system." Working paper, Office of Research, College of Commerce and Business Administration, University of Illinois, Urbana-Champaign, Illinois.Google Scholar
- Wright, S.; Chan, Y. (1994). "A network with side constraints formulation of the
*k*-medoid method for optimal plant location applied to image classification." Working paper. Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 2005