CO 437BCombinatorial Optimization
- Faculty
- Mathematics
- Offered
- Winter
- Credit
- 0.5
- Last listed
- 1978–79
No longer offered. It’s in Waterloo’s scanned calendars from 1978–79 to 1978–79 (before that, 1976–77 to 1977–78 used the number for Optimizational Combinatorics 2); 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. Prereq: C & 0 437a or consent of instructor
As printed in the 1978–79 calendar, read by OCR; the scanned page is the original.
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.
1978–79 1 calendar
Branchings in networks. Elementary matroid theory illustrated by forests, transversals, algebraic dependence, and geometry. Matroid partitions and intersections. Submodular functions and polymatroids. Prereq: C & 0 437a or consent of instructor
Offered Winter · 2 class hours a week · 0.5 credit
1976–77 to 1977–78 2 calendars
Another title: Optimizational Combinatorics 2, probably a different course under the same number (or a misread scan).
Branchings in networks. Elementary matroid theory
illustrated by forests, transversals, algebraic depen-
dence, and geometry. Matroid partitions and
intersections. Submodular functions and polymatroids. Recommended for students interested in theoretically
advanced study in Combinatorics and Optimization or
Computer Science.
Prereq: C & O 437a or consent of instructor
Offered Winter · 2 class hours a week · 0.5 credit