A Computational Approach to the Selection of an Optimal Network

Hoang Hai Hoc
Additional contact information
Hoang Hai Hoc: University of Montreal

Management Science, 1973, vol. 19, issue 5, 488-498

Abstract: We consider the problem of selecting an optimal traffic network in its simplest form, where there are no congestion costs. The superadditive effect of deleted links on the objective function is pointed out and used to develop some implicit enumeration procedures for this problem. Some efforts are devoted to evaluate these algorithms, and to show how to stop the computations with an "acceptable" approximate solution when computations are taking too much time.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.19.5.488 (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:ormnsc:v:19:y:1973:i:5:p:488-498

Access Statistics for this article

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