Suggests: grDevices, graphics, png, ucminf
Author: Fernando Fernandez-Palacin <fernando.fernandez@uca.es> and Manuel
Description: This version of the package deals with 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
Collate: 'andalusia.R' 'as.R' 'loca.p.R' 'orloca-package.R'
'zsuml2min.R' 'zsuml2.R' 'zsumlpmin.R' 'zsumlp.R' 'zsummin.R'

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

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.

Imports: grDevices, graphics, knitr, stats

Title: Spanish version of orloca package
Description: Version espanola del paquete orloca que trata de los modelos de Localizacion en Investigacion Operativa (Operations Research LOCational Analysis). En particular, el problema de encontrar el punto que minimiza la suma ponderada de las distancias a un conjunto de puntos dados.
Packaged: Thu Jul  3 11:20:53 2008; mmarquez

Packaged: Thu Nov 20 11:55:11 2008; mmarquez

Description: Version espanola del paquete orloca que trata de los
modelos de Localizacion en Investigacion Operativa (Operations
Research LOCational Analysis). En particular, el problema de
encontrar el punto que minimiza la suma ponderada de las
distancias a un conjunto de puntos dados.