24 lines
631 B
Text
24 lines
631 B
Text
---
|
|
id: min-cost-flow
|
|
title: "Minimum Cost Flow"
|
|
author: Benjamin Qi
|
|
description: "?"
|
|
prerequisites:
|
|
- Platinum - Maximum Flow
|
|
frequency: 1
|
|
---
|
|
|
|
<info-block title="Pro Tip">
|
|
Historically restricted to USACO Camp.
|
|
</info-block>
|
|
|
|
(Hungarian)
|
|
|
|
* Tutorial
|
|
* [TopCoder](https://www.topcoder.com/community/data-science/data-science-tutorials/minimum-cost-flow-part-two-algorithms/)
|
|
* [Johnson's Algorithm](https://en.wikipedia.org/wiki/Johnson%27s_algorithm)
|
|
* Problems
|
|
* [April Fool's Problem](http://codeforces.com/contest/802/problem/N)
|
|
* [Cow & Exercise](https://codeforces.com/contest/1307/problem/G)
|
|
* consider LP dual
|