An Efficient Minimal Cost Flow Algorithm

G. E. Bennington
Additional contact information
G. E. Bennington: North Carolina State University

Management Science, 1973, vol. 19, issue 9, 1042-1051

Abstract: One of the methods of solving the minimal cost flow problem is to find cycles of negative length in a marginal cost network. These negative cycles indicate a change in the flows around the cycle, which will result in a reduction in the total cost. The proposed method finds negative cycles by attempting to find the shortest chains from a fixed node to all other nodes. Results of computational experiments comparing this algorithm with the out-of-kilter algorithm are presented. These results indicate that the proposed method of repetitively detecting negative cycles yields an efficient minimal cost flow algorithm.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.19.9.1042 (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:9:p:1042-1051

Access Statistics for this article

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