References
- Weiszfeld , E. 1937 . Sur le point pour lequel la somme des distances de n points donnés est minimum . The Tôhoku Mathematical Journal , 43 : 355 – 386 .
- Francis , R.L. and Goldstein , J.M. 1974 . Location theory: A selective bibliography . Õperations Research , 22 : 400 – 410 .
- Chandrasekaran , R. and Tamir , A. 1990 . Algebraic Optimization: The Fermat-Weber Location Problem . Mathematical Programming , 46 ( 2 ) : 219 – 224 .
- Armstrong , R.D. 1977 . A Primal Simplex Algorithm to solve a vectilinear distance facility location problem . Naval Research Logistics Quarterly , 24 ( 2 ) : 619 – 626 .
- Francis , R.L. and White , J.A. 1974 . “ Facility layout and location ” . In An Analytical Approach , Englewood Cliffs, NJ : Prentice-Hall .
- Michelot , C. and Lefebvre , O. 1987 . A Primal dual algorithm for the Fermat-Weber problem involving mixed gauges . Mathematical Programming , 39 : 319 – 355 .
- Eggleston , H.G. 1958 . Convexity , Cambridge University Press .
- Grötschel , M. , Lovász , L. and Schrijver , A. 1988 . Geometric Algorithms and Combinatorial Optimization , Springer-Verlag .
- Overton , M.L. 1983 . A quadratically convergent method for minimizing a sum of Euclidean norm . Mathematical Programming , 27 : 34 – 63 .
- Overton , M.L. 1981 . “ A fast algorithm for Euclidean distance location problem ” . In Numerical Analysis , Edited by: Hennart , J.P. Mexico : Springer-Verlag .