Maximum-flow minimum-cut and optimum assignment with the Hungarian algorithm

What this note covers

1. Represent capacity and feasible flow
2. Find augmenting paths systematically
3. Use cuts to certify maximum flow
4. Set up an assignment cost matrix
5. Carry out the Hungarian algorithm
6. Audit optimisation claims and context

6 sections · 10 key terms & formulas · 6 common mistakes