Combinatorial Programming and the Planning of Urban and Regional Systems
Bibliographic Data
| ID | 4142282 |
|---|---|
| Authors | Aaron J Scott (0000-0002-8742-5970, University of Toronto, corresponding author) |
| Year | 1969 |
| Volume | 1 |
| Issue | 2 |
| Pages | 125-142 |
| Publication date | 1969-12-01 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Environment and Planning A Economy and Space (JOURNAL) |
| Journal identifiers | ISSN: 0308-518X • E-ISSN: 1472-3409 |
| Publisher | SAGE Publications Inc (PUBLISHER) |
| DOI | 10.1068/a010125 |
| OpenAlex | W2077374515 |
| Language | EN |
| Citations received | 1 |
| References cited | 60 |
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
Civil engineering · Graph · Management science · Network planning and design · Operations research · Regional planning · Transport engineering · Transportation planning · Urban planning · Computer Science · Engineering · Facility Location and Emergency Management · Transportation Planning and Optimization · Vehicle Routing Optimization Methods · Artificial Intelligence · Theoretical Computer Science
Central Facilities Location
Assignment Problems and the Location of Economic Activities
Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
Hierarchical Grouping to Optimize an Objective Function
The City of the Future
Industrial development planning models with economies of scale and indivisibilities
A programming model of an integrated transportation network
| Citations per year | 0.02 |
|---|---|
| Citation span | 1971 - 1971 (1) |
| Highly cited | No |