Networks and Basic Solutions

Ellis L. Johnson
Additional contact information
Ellis L. Johnson: Yale University, New Haven, Connecticut

Operations Research, 1966, vol. 14, issue 4, 619-623

Abstract: A labeling procedure which could be used to carry out the steps of the simplex algorithm for a network flow problem is given. A modification of the simplex algorithm for the maximum flow problem is suggested which is equivalent to the Ford-Fulkerson algorithm if the solutions are kept basic in the latter. A procedure to keep the solutions basic in the Ford-Fulkerson algorithm is given. An example of a flow with gains problem with integer capacities and gains is given for which the usual labeling procedure may not lead to an optimum solution if the solutions are not kept basic. Extension of the network flow techniques to flows with gains is discussed.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.4.619 (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:14:y:1966:i:4:p:619-623

Access Statistics for this article

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