COURSE CURRICULUM

The Combinatorics and Optimization (CO) program offers a wide range of courses that explore the mathematical foundations and real-world applications of optimization, discrete mathematics, and theoretical computer science. Students begin with introductory courses in optimization (CO227, CO250, CO255) and progress to advanced topics like nonlinear (CO367), convex (CO463), integer (CO452), and semidefinite optimization (CO471). Core areas include graph theory (CO342, CO442, CO444), combinatorics (CO330, CO430, CO434), and combinatorial optimization (CO450), along with specialized applications in scheduling (CO454), game theory (CO456), and portfolio optimization (CO372). The program also integrates topics in coding theory (CO331), information theory (CO432), and cryptography (CO485, CO487), as well as quantum computing (CO481, CO486), reflecting the interdisciplinary nature of the field. Students gain both theoretical depth and practical tools for solving complex problems in areas such as logistics, finance, network design, and data security. With unique courses like CO380 (Mathematical Discovery and Invention) and CO480 (History of Mathematics), the program fosters creative thinking and a deep appreciation for the development of mathematical ideas. Through this extensive course offering, CO students are equipped for advanced research or high-impact careers in operations research, tech, finance, and beyond.