MATH 417(a) Optimizational Combinatorics-A
- Faculty
- Mathematics
- Last listed
- 1974–75
No longer offered. It’s in Waterloo’s scanned calendars from 1971–72 to 1974–75; 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. Recommended for students interested in theoretically advanced study in Combinatorics and Optimization or Computer Science. 2 hours lectures, one term Prerequisite: M352 (a) or consent of instructor
As printed in the 1973–74 to 1974–75 calendars, read by OCR; the scanned page is the original.
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1971–72 to 1974–75, 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.
1973–74 to 1974–75 2 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. Recommended for students interested in theoretically advanced study in Combinatorics and Optimization or Computer Science. 2 hours lectures, one term Prerequisite: M352 (a) or consent of instructor
1972–73 1 calendar
Another title: Algebraic Graph Theory, probably a different course under the same number (or a misread scan).
* Listed that year without a description, or as not offered.
1971–72 1 calendar
Titled Combinatorics and Optimization.
Algorithms and theory in the intersection of combinatorics and optimization. The Hitchcock problems. Optimum paths and flows in networks. Efficiency of algorithms. Convex polyhedra. Linear programming and max-min relations. Totally unimodular matrices. Elementary matroid theory, illustrated by algebraic dependence, forests, transversals, and geometry. Sub-modular functions, polymatroids, and the greedy algorithm. Boolean and Integer programming. The Knapsack problem. Matchings and constrained subgraphs. Branchings in networks. Matroid partitions and intersections. Bottleneck Extrema. 2 hours lectures.