Hamilton cycles and Euler tours. Connectedness, matching, and coloring. Flows in capacity-constrained networks. Maximum flow and minimum cost flow problems. 634 Combinatorial Optimization Topics in combinatorics, graphs, and networks, including matching, matroids, polyhedral combinatorics, and optimization algorithms.
Topics change each semester.
This course may be taken more than once for credit. Application to linear and convex programming and the linear complementarity problem. 636 Integer Programming Discrete optimization . Linear programming in which the values are restricted to integers. Theory, algorithms, and applications.