Convex Land Acquisition with Zero-One Programming

Justin C Williams
Additional contact information
Justin C Williams: Department of Geography and Environmental Engineering, Johns Hopkins University, Baltimore, MD 21218, USA

Environment and Planning B, 2003, vol. 30, issue 2, 255-270

Abstract: The land-acquisition problem involves selecting multiple discrete parcels to be acquired for a particular land use. In previous models, typical selection criteria have been land cost, land area, and spatial attributes such as contiguity and compactness. Here I introduce a new spatial attribute, convexity. I develop a way to approximate convex shapes in continuous space with ‘cellularly convex’ shapes composed of grid cells. A zero-one programming model is formulated for finding minimum-cost cellularly convex regions of specified area. Computational experience with 144-cell and 1024-cell demonstration problems is reported, and results and extensions are discussed.

Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b12925 (text/html)

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:sae:envirb:v:30:y:2003:i:2:p:255-270

DOI: 10.1068/b12925

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().