A note on convergence in the single facility minisum location problem
- 1 May 1998
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 35 (9) , 25-31
- https://doi.org/10.1016/s0898-1221(98)00054-6
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp DistancesOperations Research, 1993
- Local convergence in a generalized Fermat-Weber problemAnnals of Operations Research, 1992
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problemMathematical Programming, 1989
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” FunctionOperations Research, 1981
- Mathematical Models of Road Travel DistancesManagement Science, 1979
- A note on Fermat's problemMathematical Programming, 1973
- Modelling Inter-city Road Distances by Mathematical FunctionsJournal of the Operational Research Society, 1972
- Location-Allocation ProblemsOperations Research, 1963
- AN EFFICIENT ALGORITHM FOR THE NUMERICAL SOLUTION OF THE GENERALIZED WEBER PROBLEM IN SPATIAL ECONOMICSJournal of Regional Science, 1962
- Link-Length Minimization in NetworksOperations Research, 1958