Combinatorial programming and the planning of urban and regional systems

This paper reviews and evaluates some of the major recent developments in combinatorial programming. General solution procedures are discussed. A variety of planning applications is then examined. These applications are initially categorized as either (a) network or graph-theoretic problems, or (b) grouping and partitioning problems. The rôle of these various methods and applications in the planning of urban and regional systems is then critically assessed.