Applications of Maximal Network Flow Problems in Transportation and Assignment Problems

Vinai K. Singh, Indu Kala Tripathi & Nimisha

Abstract


 This paper presents some modifications of Ford-Fulkerson’s labeling method for solving the maximal network flow problem
with application in solving the transportation and assignment problems. The modifications involve the tree representation
of the nodes labeled and the edges used them. It is shown that after each flow adjustment some of the labels can
be retained for the next labeling process. Through certain computational aspects it has been suggested that to indicate
that with theses the primal-dual approach for solving the transportation and assignment problems is improved to certain
extent.


Full Text: PDF

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.