An Algorithm for the Discrete Network Design Problem

Larry J. Leblanc
Additional contact information
Larry J. Leblanc: Southern Methodist University, Dallas, Texas

Transportation Science, 1975, vol. 9, issue 3, 183-199

Abstract: This paper addresses the problem of determining which links should be improved in an urban road network so that total congestion in the city is minimized. A nonlinear mixed integer programming model is developed, and strategies for a branch-and-bound algorithm are presented. Particular attention is paid to the computational aspects of large-scale problems, and numerical results are reported.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (78)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.9.3.183 (application/pdf)

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:inm:ortrsc:v:9:y:1975:i:3:p:183-199

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().