A Zero‐One Programming Model for Contiguous Land Acquisition

The land acquisition problem is a spatial partitioning problem that involves selecting multiple parcels to be acquired for a particular land use. Three selection criteria are considered: total cost, total area, and spatial contiguity. Achieving contiguity or connectivity has been problematic in previous exact methods for land acquisition. Here we present a new zero‐one programming model that enforces necessary and sufficient conditions for achieving contiguity in discrete cell landscapes, independent of other spatial attributes such as compactness. Computational experience with several demonstration problems is reported, and results and extensions are discussed.