minimum cost maximum flow
Description: A network optimization problem that finds the greatest feasible flow from a source to a sink at the lowest total edge cost.
Related topic: Complexity and Algorithms in Graphs (15%)
OpenAlex ID: keywords/minimum-cost-maximum-flow
