The Discrete Optimization Group (DISCO) and the Combinatorial Optimization and Graph Algorithms Group (COGA) jointly offer the following courses.
Advanced combinatorial optimization, including matchings, matroids, integer programming, and the travelling salesperson problem.
Algorithmic techniques and performance guarantees for optimization problems that are difficult to solve exactly.
Data structures, graph algorithms, compression, search trees, computability, complexity, and practical programming.
Recent research and selected papers in discrete and combinatorial optimization.
Foundations of linear programming, duality, graph algorithms, matchings, and computational complexity.
Equilibria, congestion games, mechanism design, social choice, and the computation and efficiency of strategic outcomes.
Advanced algorithms and structural results for flow problems in networks.
Convex models, optimization methods, and their applications in mathematics and related fields.
An introduction to computational mathematics, algorithms, data structures, numerical representation, and programming.