At the University of Waterloo, "CO" courses are part of the Combinatorics and Optimization (CO) program. This program is housed within the Faculty of Mathematics and covers a range of topics in combinatorics, graph theory, and optimization.
Some example courses include:
- CO 342: Introduction to Graph Theory: This course covers key topics such as connectivity, planarity, and matchings.
- CO 351: Network Flow Theory: This course involves linear programming, shortest path problems, and network simplex algorithms.
- CO 367: Nonlinear Optimization: This course addresses the fundamentals of nonlinear optimization, including both the mathematical and computational aspects.
- CO 450: Combinatorial Optimization: Focuses on network flows, optimal matchings, and matroid optimization.
These courses are designed to equip students with mathematical models and methods to solve complex problems in various fields such as business, industry, and science.
For more detailed information about the courses offered in this program, you can visit the University of Waterloo's official course catalog or the Combinatorics and Optimization section on their website (UCalendar) (Cheriton School of Computer Science).