A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost

• Aneja, Z.P. and M. Parlar. (1994). “Algorithms for Weber Facility Location in the Presence of Forbidden Regions and or Barriers to Travel.” Transportation Science 28, 70–76.

  Google Scholar 

• Beasley, J.E. (1993). “Lagrangean Heuristic for Location Problems.” European Journal of Operational Research 65, 383–399.

  Article  Google Scholar 

• Brandeau, M.L. and S.S. Chiu. (1989). “An Overview of Representative Problems in Location Research.” Management Science 35, 645–674.

  Google Scholar 

• Brimberg, J., P. Hansen, N. Mladenović, and E.D. Taillard. (2000). “Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem.” Operations Research 48, 444–460.

  Article  Google Scholar 

• Brimberg, J. and R.F. Love. (1993). “Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances.” Operations Research 41, 1153–1163.

  Google Scholar 

• Butt, S.E. and T.M. Cavalier. (1996). “An Efficient Algorithm for Facility Location in the Presence of Forbidden Regions.” European Journal of Operational Research 90, 56–70.

  Article  Google Scholar 

• Cooper, L. (1963). “Location-Allocation Problem.” Operations Research 11, 331–343.

  Google Scholar 

• Drezner, Z. (1996). Facility Location: A Survey of Applications and Methods. NY: Springer.

  Google Scholar 

• Drezner, Z. and H.W. Hamacher. (2002). Facility Location: Applications and Theory. NY: Springer.

  Google Scholar 

• Drezner, Z. and D. Simchi-Levi. (1992). “Asymptotic Behavior of the Weber Location Problem on the Plane.” Annals of Operations Research 40, 163–172.

  Article  Google Scholar 

• Eilon, S., C.D.T. Watson-Gandy, and N. Christofides. (1971). Distribution Management. New York: Hafner.

  Google Scholar 

• Francis, R.L., F. Leon, L.F. McGinnis, and J.A. White. (1992). Facility Layout and Location: An Analytical Approach. NY: Prentice Hall.

  Google Scholar 

• Gamal, M.D.H. and S. Salhi. (2001). “Constructive Heuristics for the Uncapacitated Location-Allocation Problem.” Journal of the Operational Research Society 51, 1233–1240.

  Google Scholar 

• Hakimi, S.L. (1965). “Optimal Distribution of Switching Centers in a Communications Network and Some Related Graph Theoretic Problems.” Operations Research 13, 462–475.

  Article  Google Scholar 

• Hamacher, H. and K. Klamroth. (2000). “Planar Location Problems with Barriers Under Polyhedral Gauges.” Annals of Operations Research 96, 191–208.

  Article  Google Scholar 

• Hansen, P., D. Peeters, and J. Thisse. (1982). “An Algorithm for a Constrained Weber Problem.” Management Science 28, 1285–1295.

  Google Scholar 

• Hansen, P., N. Mladenović, and E.D. Taillard. (1998). “Heuristic Solution of the Multisource Weber problem as a p-Median Problem.” Operations Research Letters 22, 55–62.

  Article  Google Scholar 

• Klamroth, K. (2001). “A Reduction Result for Location Problems with Polyhedral Barriers.” European Journal of Operational Research 130, 486–497.

  Article  Google Scholar 

• Klamroth, K. (2003). “Algebraic Properties of Location Problems with One Circular Barrier (in press).” European Journal of Operational Research.

• Körkel, M. (1989). “On the Exact Solution to Large-Scale Simple Plant Location Problems.” European Journal of Operational Research 39, 157–173.

  Article  Google Scholar 

• Love, R.F., J.G. Morris, and G.O. Wesolowsky. (1988). Facility location: Models and Methods.” NY: North Holland.

• Megiddo, N. and K.J. Supowit. (1984). “On the Complexity of Some Common Geometric Location Problems.” SIAM Journal on Computing 13, 182–196.

  Article  Google Scholar 

• Mirchandani, P.B. and R.L. Francis. (1989). Discrete Location Theory. NY: Wiley.

  Google Scholar 

• Salhi, S. (1997). “A Perturbation Heuristic for a Class of Location Problems.” Journal of the Operational Research Society 48, 1233–1240.

  Article  Google Scholar 

Download references