Combinatorial Programming and the Planning of Urban and Regional Systems

Allen Scott

Environment and Planning A, 1969, vol. 1, issue 2, 125-142

Abstract: 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 role of these various methods and applications in the planning of urban and regional systems is then critically assessed.

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

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/a010125 (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:envira:v:1:y:1969:i:2:p:125-142

DOI: 10.1068/a010125

Access Statistics for this article

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