Objects and methods to handle and solve the minsum location problem, also known as FermatWeber problem. The minsum location problem search for a point such that the weighted sum of the distances to the demand points are minimized. See "The FermatWeber location problem revisited" by Brimberg, Mathematical Programming, 1, pg. 7176, 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. 355386, 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. 741, 2009. <DOI:10.1007/s104790080352z>.
Package details 


Author  Manuel MunozMarquez <[email protected]> 
Maintainer  Manuel MunozMarquez <[email protected]> 
License  GPL (>= 3) 
Version  4.6 
URL  http://knuth.uca.es/orloca 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.