Example 4.2: Minimum Cost Flow Problem You can continue to use the pineapple example in Example 4.1 by supposing that the airlines now stipulate that no more than 350 pineapples per week can be ...

With Kin's algorithm, all important network flow problems, including maximum flow and minimum cost problems, can now be treated as special cases of the minimum cost flow problem.