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.

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