Minisum Location with Closest Euclidean Distances

J. Brimberg and G.O. Wesolowsky

Annals of Operations Research, 2002, vol. 111, issue 1, 165 pages

Abstract: This paper considers the problem of locating a facility not among demand points, as is usually the case, but among demand regions which could be market areas. The objective is to find the location that minimizes the sum of weighted Euclidean distances to the closest points of the demand regions. It is assumed that internal distribution within the areas is “someone else's concern”. A number of properties of the problem are derived and algorithms for solving the problem are suggested. Copyright Kluwer Academic Publishers 2002

Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1020901719463 (text/html)
Access to full text is restricted to subscribers.

Related works:
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:spr:annopr:v:111:y:2002:i:1:p:151-165:10.1023/a:1020901719463

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1020901719463

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().