Skip to main content
SpringerLink
Log in

A fast algorithm for the Euclidean distance location problem

  • Conference paper
  • First Online:
Book cover Numerical Analysis

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 909))

  • 466 Accesses

This work was supported in part by the United States Department of Energy grant DE-AC02-76ERO3077.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • P. H. Calamai and A. R. Conn (1980). A stable algorithm for solving the multifacility location problem involving Euclidean distances, SIAM J. Scient. and Stat. Comp. 1, pp. 512–526.

    Article  MathSciNet  MATH  Google Scholar 

  • J. A. Chatelon, D. W. Hearn and T. J. Lowe (1978). A subgradient alogirthm for certain minimax and minisum problems. Math. Prog. 15, pp. 130–145.

    Article  MathSciNet  MATH  Google Scholar 

  • F. Cordellier and J. Ch. Fiorot (1978). On the Fermat-Weber problem with convex cost functionals, Math. Prog. 14, pp. 295–311.

    Article  MathSciNet  MATH  Google Scholar 

  • U. Eckhardt (1975). On an optimization problem related to minimal surfaces with obstacles, in R. Bulirsch, W. Oettli and J. Stoer, eds., Optimization and Optimal Control, Lecture Notes in Mathematics 477, Springer-Verlag, Berlin and New York.

    Chapter  Google Scholar 

  • U. Eckhardt (1980). Weber's problem and Weiszfeld's algorithm in general spaces, Math. Prog. 18, pp. 186–196.

    Article  MathSciNet  MATH  Google Scholar 

  • R. L. Francis, and J. M. Goldstein (1974). Location theory: a selective bibliography, Operations Research 22, pp. 400–410.

    Article  MathSciNet  MATH  Google Scholar 

  • H. W. Kuhn (1967). On a pair of dual nonlinear programs, in Nonlinear Programming (J. Abadie, ed.), North-Holland, Amsterdam, pp. 38–54.

    Google Scholar 

  • H. W. Kuhn (1973). A note on Fermat's problem, Math. Prog. 4, pp. 98–107.

    Article  MATH  Google Scholar 

  • M. L. Overton (1981). A quadratically convergent algorithm for minimizing a sum of Euclidean norms, Computer Science Dept. Report 030, Courant Institute of Mathematical Sciences, New York University.

    Google Scholar 

  • B. N. Parlett (1980). The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, N.J.

    MATH  Google Scholar 

  • S. Schechter (1970). Minization of a convex function by relaxation, in Integer and Nonlinear Programming (J. Abadie, ed.), North-Holland, Amsterdam and London.

    Google Scholar 

  • H. Voss and U. Eckhardt (1980). Linear convergence of generalized Weiszfeld's method. Computing 25, pp. 243–251.

    Article  MathSciNet  MATH  Google Scholar 

  • E. Weiszfeld (1937). Sur le point par lequel la somme des distances de n points donnés est minimum, Tohoku Mathematics J. 43, pp. 355–386.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, 10012, New York, NY, USA

    Michael L. Overton

Authors
  1. Michael L. Overton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. P. Hennart

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag

About this paper

Cite this paper

Overton, M.L. (1982). A fast algorithm for the Euclidean distance location problem. In: Hennart, J.P. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092963

Download citation

  • DOI: https://doi.org/10.1007/BFb0092963

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11193-1

  • Online ISBN: 978-3-540-38986-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation