A Partitioning Problem with Applications in Regional Design

H. W. Corley and S. D. Roberts
Additional contact information
H. W. Corley: University of Texas at Arlington, Arlington, Texas
S. D. Roberts: University of Florida, Gainesville, Florida

Operations Research, 1972, vol. 20, issue 5, 1010-1019

Abstract: Many problems in two-dimensional location analysis can be formulated as one of optimally dividing a given region into n subregions with specified areas. Examples are problems involving districting, facility design, warehouse layout, and urban planning. This paper contains a study of such a partitioning problem. Theoretical results are presented for a problem of optimally partitioning a given set of points in k -dimensional Euclidean space into n subsets, where each subset has a specified Lebesgue measure. The existence of an optimal solution is established, and necessary and sufficient optimality conditions are proved. Models are then formulated in terms of this partitioning problem for specific districting and warehouse-layout problems.

Date: 1972
References: Add references at CitEc
Citations:

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

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:inm:oropre:v:20:y:1972:i:5:p:1010-1019

Access Statistics for this article

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