doi:10.1007/BF01592245>. General global optimization algorithms are used to solve the problem, along with the adhoc Weiszfeld method, see "Sur le point pour lequel la Somme des distances de n points donnes est minimum", by Weiszfeld, Tohoku Mathematical Journal, First Series, 43, pg. 355-386, 1937 or "On the point for which the sum of the distances to n given points is minimum", by E. Weiszfeld and F. Plastria, Annals of Operations Research, 167, pg. 7-41, 2009. <doi:10.1007/s10479-008-0352-z>.">

orloca: Operations Research LOCational Analysis Models (original) (raw)

Objects and methods to handle and solve the min-sum location problem, also known as Fermat-Weber problem. The min-sum location problem search for a point such that the weighted sum of the distances to the demand points are minimized. See "The Fermat-Weber location problem revisited" by Brimberg, Mathematical Programming, 1, pg. 71-76, 1995. <doi:10.1007/BF01592245>. General global optimization algorithms are used to solve the problem, along with the adhoc Weiszfeld method, see "Sur le point pour lequel la Somme des distances de n points donnes est minimum", by Weiszfeld, Tohoku Mathematical Journal, First Series, 43, pg. 355-386, 1937 or "On the point for which the sum of the distances to n given points is minimum", by E. Weiszfeld and F. Plastria, Annals of Operations Research, 167, pg. 7-41, 2009. <doi:10.1007/s10479-008-0352-z>.

Version: 5.6
Depends: methods, png, ucminf
Imports: grDevices, graphics, knitr, rmarkdown, stats
Suggests: orloca.es, testthat (≥ 3.0.0)
Published: 2024-02-07
DOI: 10.32614/CRAN.package.orloca
Author: Manuel Munoz-Marquez
Maintainer: Manuel Munoz-Marquez <manuel.munoz at uca.es>
License: GPL (≥ 3)
URL: http://knuth.uca.es/orloca/
NeedsCompilation: no
Language: en, es
Materials:
In views: HighPerformanceComputing
CRAN checks: orloca results

Documentation:

Downloads:

Reverse dependencies:

Linking:

Please use the canonical formhttps://CRAN.R-project.org/package=orlocato link to this page.