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.
|Author||Manuel Munoz-Marquez <[email protected]>|
|Date of publication||2017-10-24 15:15:40|
|Maintainer||Manuel Munoz-Marquez <[email protected]>|
|License||GPL (>= 3)|
|Package repository||View on R-Forge|
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.