CO 431BCombinatorial Optimization
- Faculty
- Mathematics
- Offered
- Winter
- Credit
- 0.5
- Last listed
- 1980–81
No longer offered. It’s in Waterloo’s scanned calendars from 1979–80 to 1980–81; the 1995–96 to 2023–24 calendars are on ucalendar.
Branchings in networks. Elementary matroid theory illustrated by forests, transversals, algebraic dependence, and geometry. Matroid partitions and intersections. Submodular functions and polymatroids. (C & O 437b)
As printed in the 1979–80 to 1980–81 calendars, read by OCR; the scanned page is the original.
Requirements, as last listed
Prereq: C & O 431a
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1979–80 to 1980–81, 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.
1979–80 to 1980–81 2 calendars
Branchings in networks. Elementary matroid theory illustrated by forests, transversals, algebraic dependence, and geometry. Matroid partitions and intersections. Submodular functions and polymatroids.
(C & O 437b)
Prereq: C & O 431a
Offered Winter · 2 class hours a week · 0.5 credit