Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms

Amzad Ali, R. Helgason, J. Kennington and H. Lall
Additional contact information
R. Helgason: Southern Methodist University, Dallas, Texas
J. Kennington: Southern Methodist University, Dallas, Texas
H. Lall: Southern Methodist University, Dallas, Texas

Operations Research, 1980, vol. 28, issue 4, 995-1000

Abstract: This note presents our computational experience using specialized techniques for solving multicommodity network flow problems. The algorithms investigated include a price-directive decomposition procedure, a resource-directive decomposition procedure using subgradient optimization, and a primal partitioning procedure.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.4.995 (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:oropre:v:28:y:1980:i:4:p:995-1000

Access Statistics for this article

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