Back to Discover
🔢

Minimum-cost flow problem

math Maturity 11-13

We want to move things from one place to another.

Minimum weight bipartite matching.pdf
Minimum weight bipartite matching.pdf
We want to do this for the least cost. This helps us find the best way to send goods. It can help a truck find a good road. It makes things easy for us. Can you think of a way to save money?

57 words
🖼️ Images & Media (1)
Minimum weight bipartite matching.pdf
Up Next
🔢
Shortest path problem
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Shortest path problem 0% Flow network 0% Max-flow min-cut theorem 0% Maximum flow problem 0% Optimal facility location 0% Push–relabel maximum flow algorithm 0%

🔬 Go deeper

More advanced topics to explore

Shortest path problem Optimal facility location Dijkstra's algorithm Travelling salesman problem

🪜 Step back

Simpler topics to build understanding

Flow network Max-flow min-cut theorem Maximum flow problem Push–relabel maximum flow algorithm
📚 Content adapted from Wikipedia | Readability: FK 12.7 | Vital Level 5