Operations Research LOCational Analysis Models R package orloca version 5.6 CRAN Task View: HighPerformanceComputing (https://CRAN.R-project.org/view=HighPerformanceComputing) 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>. Software Depends: methods, png, ucminf Imports: grDevices, graphics, knitr, rmarkdown, stats Suggests: orloca.es, testthat (>= 3.0.0) Manuel Munoz-Marquez <manuel.munoz@uca.es> Comprehensive R Archive Network (CRAN) Manuel Munoz-Marquez <manuel.munoz@uca.es> GPL (>= 3) 2024-02-07 application/tgz https://CRAN.R-project.org/package=orloca doi:10.32614/CRAN.package.orloca en, es