A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem

Computers and Mathematics with Applications

Volumn 59, Issue 1, 2010, Pages 399-410

  Norman Katz, I ^a   Vogl, Steven R ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Asymmetric distance; Generalized Fermat location; Weiszfeld algorithm

Indexed keywords

DESCENT METHOD; DESTINATION POINTS; EUCLIDEAN DISTANCE; GENERALIZED FERMAT LOCATION; GLOBALLY CONVERGENT; INITIAL GUESS; ITERATION MATRICES; ITERATIVE ALGORITHM; LOCAL CONVERGENCE; LOCATION PROBLEMS; NUMERICAL EXAMPLE; WEISZFELD ALGORITHMS;

ITERATIVE METHODS;

ALGORITHMS;

EID: 73449141081     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2009.07.007     Document Type: Article

References (18)

1. Cooper L. Location-allocation problems. Oper. Res. 11 (1963) 331-343
2. Cooper L. Heuristic methods for location-allocation problems. SIAM Rev. 6 (1964) 37-52
3. Cooper L. Solutions of generalized locational equilibrium problems. J. Regional Sci. 7 (1967) 1-18
4. Cooper L. An extension of the generalized Weber problem. J. Regional Sci. 8 (1968) 181-197
5. Cooper L., and Norman Katz I. The Weber problem revisited. J. Comput. Math. Appl. 7 (1981) 225-235
6. Norman Katz I. On the convergence of a numerical scheme for solving some locational equilibrium problems. SIAM J. Appl. Math. 17 (1969) 1224-1231
7. Norman Katz I. Local convergence in Fermat's problem. Math. Program. 6 (1974) 89-104
8. Kuhn H.W., and Kuenne R.E. an efficient algorithm for the numerical solution of the generalized Weber problem in spatial economics. J. Regional Sci. 4 (1962) 21-23
9. Kuhn H.W. A Note on Fermat's problem. Math. Program. 4 (1973) 98-107
10. Miehle W. Link-length minimization in networks. Oper. Res. 6 (1958) 232-243
11. Plastria F., and Elosmani M. On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems. TOP 16 (2008) 388-406
12. Morris J.G. Convergence of the Weiszfeld algorithm for Weber problems using a generalized "distance" function. Oper. Res. 29 (1981) 37-47
13. Xue G., and Ye Y. An efficient algorithm for minimizing a sum of P-norms. SIAM J. Optim. (1997)
14. Eckhardt U. Weber's problem and Weiszfeld's algorithm in general spaces. Math. Program. 18 (1980) 186-196
15. Li Y. A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances. Comput. Optim. Appl. 10 (1998) 219-242
16. Edmund K.A., Christiansen E., Conn A.R., and Overton M.L. An efficient primal-dual interior-point method for minimizing a sum of Euclidean norms. SIAM J. Sci. Comput. (1998)
17. Weiszfeld E. Sur le point pour lequel la sommme des distances de n points donnes est minimum. Tohoku Math. J. 43 (1937) 355-386
18. Golub G.H., and Van Loan C.F. Matrix Computations. second ed. (1989), The Johns Hopkins University Press