Minimum-Cost Flow Problem

The minimum -cost flow problem, or min -cost flow problem is a general framework for distribution, transport and flow problems dar. general, may attempt to transport a quantity of a good of provider nodes through transfer points to the need for nodes and to the lowest possible cost. Known Issues in this category are the Umladeproblem or the transportation problem. When asked for the maximum amount of goods by all providers ( sources) to all buyers (sinks) can be transported, it is called maximum -flow problems.