×

The Weber problem revisited. (English) Zbl 0457.65044


MSC:

65K05 Numerical mathematical programming methods
90C30 Nonlinear programming
65D10 Numerical smoothing, curve fitting

Citations:

Zbl 0017.18007
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Weiszfeld, E., Sur le point pour lequel la somme des distances de \(n\) points donnés est minimum, Tohoku Math. J., 43, 335-386 (1937) · Zbl 0017.18007
[2] Cooper, L., Location-allocation problems, Ops. Res., 11, 331-343 (1963) · Zbl 0113.14201
[3] Kuhn, H. W.; Kuenne, R. E., An efficient algorithm for the numerical solution of the generalized Weber problem in spatial economics, J. Reg. Sci., 4, 21-33 (1962)
[4] B. Harris, Personal Communication.; B. Harris, Personal Communication.
[5] Kowalik, J.; Osborne, M. R., Methods for unconstrained optimization problems (1968), American Elsevier: American Elsevier New York · Zbl 0304.90099
[6] Katz, I. N., Local convergence in Fermat’s problem, Math. Prog., 6, 89-104 (1974) · Zbl 0291.90069
[7] Armijo, L., Minimization of functions having continuous partial derivatives, Pacific J. Math., 16, 1-3 (1966) · Zbl 0202.46105
[8] Polak, E., Computational Methods in Optimazation (1971), Academic Press: Academic Press New York
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.