orloca: Operations Research LOCational Analysis Models
Version 4.3

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. . 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.

Package details

AuthorManuel Munoz-Marquez <[email protected]>
Date of publication2017-10-24 21:45:53 UTC
MaintainerManuel Munoz-Marquez <[email protected]>
LicenseGPL (>= 3)
URL http://knuth.uca.es/orloca
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the orloca package in your browser

Any scripts or data that you put into this service are public.

orloca documentation built on Nov. 17, 2017, 5:10 a.m.