Skip to main content

Facility Location Problems with Spatial Interaction

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Model

Solution Methods

The Dual Ascent and Adjustment Method

Dual Ascent and Branch-And-Bound

Lagrangian Relaxation with Subgradient Optimization

Benders Decomposition

Mean Value Cross Decomposition

Comparisons and the Role of Γ

Conclusion

See also

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Math 4:238–252

    Article  MathSciNet  MATH  Google Scholar 

  2. Brown GW (1949) Some notes on computation of games solutions. RAND Report P-78

    Google Scholar 

  3. Coelho JD (1980) A locational surplus maximization approach to public facility location. Nota Centro de Estasica e Aplic Dept Mat Aplic Fac Ciences de Lisboa, Portugal, no. 15

    Google Scholar 

  4. Coelho JD, Wilson AG (1976) The optimum location and size of shopping centres. Regional Studies 4:413–421

    Article  Google Scholar 

  5. Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper Res 26:992–1009

    MathSciNet  MATH  Google Scholar 

  6. Erlenkotter D, Leonardi G (1985) Facility location with spatially interactive travel behaviour. Sistemi Urbani 1:29–41

    Google Scholar 

  7. Fisher ML (1981) The Lagrangean relaxation method for solving integer programming problems. Managem Sci 27(1):1–18

    MATH  Google Scholar 

  8. Geoffrion AM (1974) Lagrangean relaxation for integer programming. Math Program Stud 2:82–114

    MathSciNet  Google Scholar 

  9. Held M, Wolfe P, Crowder HP (1974) Validation of subgradient optimization. Math Program 6:62–88

    Article  MathSciNet  MATH  Google Scholar 

  10. Holmberg K (1992) Linear mean value cross decomposition: A generalization of the Kornai–Liptak method. Europ J Oper Res 62:55–73

    Article  MATH  Google Scholar 

  11. Holmberg K (1994) A convergence proof for linear mean value cross decomposition. Z Oper Res 39(2):157–186

    MathSciNet  MATH  Google Scholar 

  12. Holmberg K (1997) Mean value cross decomposition applied to integer programming problems. Europ J Oper Res 97:124–138

    Article  MATH  Google Scholar 

  13. Holmberg K (1999) Exact solution methods for uncapacitated location problems with convex transportation costs. Europ J Oper Res 114:127–140

    Article  MATH  Google Scholar 

  14. Holmberg K, Jörnsten K (1989) Exact methods for gravity trip distribution models. Environm Plan A 21:81–97

    Article  Google Scholar 

  15. Holmberg K, Jörnsten K (1990) An exact formulation of the simple plant location problem with spatial interaction. In: Orban-Ferauge Fr, Rasson JP (eds) Proc Meeting V of the EURO Working Group on Locational Analysis, Fac Univ Notre-Dame de-la-Paix, Namur

    Google Scholar 

  16. Holmberg K, Jörnsten K (1995) Decomposition methods for the exact formulation of the simple plant location problem with spatial interaction. Res Report, Dept Math, Linköping Inst Techn, LiTH-MAT-R-1995–13

    Google Scholar 

  17. Holmberg K, Jörnsten K (1996) A dual ascent procedure for the exact formulation of the simple plant problem with spatial interaction. Optim 36:139–152

    Article  MATH  Google Scholar 

  18. Holmberg K, Jörnsten K (1996) Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction. Location Sci 4:83–100

    Article  MATH  Google Scholar 

  19. Jacobsen SK (1986) Plant location by entropy maximization. Res Report IMSOR, DTH, Lyngby, Denmark 10

    Google Scholar 

  20. Jacobsen SK (1988) On the solution of an entropy maximizing location model by submodularity. Res Report, IMSOR, DTH, Lyngby, Denmark 6

    Google Scholar 

  21. Kornai J, Liptak Th (1965) Two-level planning. Econometrica 33:141–169

    Article  MATH  Google Scholar 

  22. Leonardi G (1978) Optimum facility location by acessibility maximizing. Environm Plan A 11:1287–1305

    Article  Google Scholar 

  23. Leonardi G (1983) The use of random-utility theory in building location-allocation models. In: Thisse JF, Zoller HG (eds) Location Analysis of Public Facilities. North-Holland, Amsterdam, pp 357–383

    Google Scholar 

  24. McDaniel D, Devine M (1977) A modified Benders partitioning algorithm for mixed integer programming. Managem Sci 24:312–319

    MATH  Google Scholar 

  25. Poljak BT (1967) A general method of solving extremum problems. Soviet Math Dokl 8:593–397

    Google Scholar 

  26. Poljak BT (1969) Minimization of unsmooth functionals. USSR Comput Math Math Phys 9:14–29

    Article  Google Scholar 

  27. Robinson J (1951) An iterative method of solving a game. Ann of MATH 54:296–301

    Article  MathSciNet  Google Scholar 

  28. Roy TJ Van (1983) Cross decomposition for mixed integer programming. Math Program 25:46–63

    Article  MATH  Google Scholar 

  29. Wilson AG (1967) A statistical theory of spatial distribution models. Transport Res 1:253–269

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Holmberg, K. (2008). Facility Location Problems with Spatial Interaction . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_173

Download citation

Publish with us

Policies and ethics