The Minisum and Minimax Location Problems Revisited

Pierre Hansen, Dominique Peeters, Denis Richard and Jacques Thisse
Additional contact information
Pierre Hansen: Institut d'Economie Scientifique et de Gestion, Lille, France, and Faculté Universitaire Catholique de Mons, Belgium
Denis Richard: Université Catholique de Louvain, Belgium

Operations Research, 1985, vol. 33, issue 6, 1251-1265

Abstract: The minisum (minimax) problem consists of locating a single facility in the plane with the aim of minimizing the sum of the weighted distances (the maximum weighted distance) to m given points. We present two solution methods for generalized versions of these problems in which (i) location is restricted to the union of a finite number of convex polygons; (ii) distances are approximated by norms that may differ with the given points; and (iii) transportation costs are increasing and continuous functions of distance. Computational experience is described.

Keywords: 185 minisum and minimax; 642 facility location (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (33)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.6.1251 (application/pdf)

Related works:
Working Paper: The minisum and minimax location problems revisited (1985)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:33:y:1985:i:6:p:1251-1265

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().