W. H. Moolman

The Maximum Flow and Minimum Cost–Maximum Flow Problems: Computing and Applications

W. H. Moolman · Asian Journal of Probability and Statistics · 2020

The maximum flow and minimum cost-maximum flow problems are both concerned with determining flows through a network between a source and a destination. Both these problems can be formulated as linear programming problems. When given information about a network (network flow diagr...

Open access Research Article 10.9734/ajpas/2020/v7i330185

The Out-of-Kilter Algorithm and Its Applications to Network Flow Problems

W. H. Moolman · Asian Journal of Probability and Statistics · 2020

The out-of-kilter algorithm, which was published by D.R. Fulkerson [1], is an algorithm that computes the solution to the minimum-cost flow problem in a flow network. To begin, the algorithm starts with an initial flow along the arcs and a number for each of the nodes in the netw...

Open access Research Article 10.9734/ajpas/2020/v7i330187