CO 437ANetwork Flow Theory
- Faculty
- Mathematics
- Offered
- Fall, Spring
- Credit
- 0.5
- Last listed
- 1978–79
No longer offered. It’s in Waterloo’s scanned calendars from 1976–77 to 1978–79; the 1995–96 to 2023–24 calendars are on ucalendar.
Algorithms and theory relating to both combinatorics and optimization. Brief review of linear programming duality theory. Optimum paths and flows in networks. Efficiency of algorithms. Convex polyhedra. Combinatorial max-min relations. Totally unimodular matrices. Integer programming. Optimum matchings and constrained subgraphs.
As printed in the 1976–77 to 1978–79 calendars, read by OCR; the scanned page is the original.
Requirements, as last listed
Prereq: C&0352a or consent of instructor
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1976–77 to 1978–79, newest first. The text is OCR of the scanned pages; years whose wording matches are shown once, from the clearest scan. Each year links to its page on uwloo and to that page of the scanned PDF.
1976–77 to 1978–79 3 calendars
Algorithms and theory relating to both combinatorics and optimization. Brief review of linear programming duality theory. Optimum paths and flows in networks. Efficiency of algorithms. Convex polyhedra. Combinatorial max-min relations. Totally unimodular matrices. Integer programming. Optimum matchings and constrained subgraphs.
Prereq: C&0352a or consent of instructor
Offered Fall, Spring · 2 class hours a week · 0.5 credit