Combinatorial Programming and the Planning of Urban and Regional Systems
Allen Scott ()
Environment and Planning A, 1969, vol. 1, issue 2, 125-142
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.
References: Add references at CitEc
Citations: View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
Journal Article: Combinatorial programming and the planning of urban and regional systems (1969)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:sae:envira:v:1:y:1969:i:2:p:125-142
Access Statistics for this article
More articles in Environment and Planning A
Bibliographic data for series maintained by SAGE Publications ().