Network Flows MATH 448 (3)
Applications of network flow models; flow decomposition; polynomial algorithms for shortest paths, maximum flows and minimum costs flows; convex cost flows; generalized flows, multi-commodity flows. Prerequisite: MATH 308. Recommended: MATH 345. Quantitative.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Abraham Punnen |
Jan 5 – Apr 11, 2016: Mon, 2:30–4:20 p.m.
Jan 5 – Apr 11, 2016: Wed, 2:30–3:20 p.m. |
Surrey Surrey |