 2016 - 2017 | |||||||||||||||||||||||||||||
 |
 |
||||||||||||||||||||||||||||
| 0365-4125-01 | Flows in Networks | ||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| FACULTY OF EXACT SCIENCES | |||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
University credit hours: 3.0
Course description
The minimum-cost flow problem, its special cases and generalizations, existence theorems, algorithms, and applications. Matching problems and matroids.