Flow cost problem

We try to find the minimum or maximum flow among a graph.

Problem variations

• The shortest path problem is close-related to minimal flow cost.
• A flow cost problem can also be transformed into an assignment problem