On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem

John J. Jarvis

Naval Research Logistics Quarterly, 1969, vol. 16, issue 4, 525-529

Abstract: The purpose of this article is to formulate the multi‐commodity maximal flow problem into a node‐arc form and to show that when decomposition is applied to this form the resulting master and subproblems become precisely those described by Ford & Fulkerson [3] using the arc‐chain formulation. A generalization to the problem is then considered which can potentially speed its convergence.

Date: 1969
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800160407

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:wly:navlog:v:16:y:1969:i:4:p:525-529

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().