Welcome to Combinatorics and Optimization
The Department of Combinatorics and Optimization at the University of Waterloo invites applications for two tenure-track faculty positions at the rank of Assistant Professor.
Spring 2018 Undergraduate Research Assistantship Program (URA) deadline of December 1st 2017 is coming up fast. Click the link to learn more about the program and how to apply. On-line applications are now being accepted.
University of Waterloo, May 5 - August 18, '17
*Recordings of occurred talks are all available on C&O's YouTube Channel.
NEW Deadline: March 1, '17
- Nov. 3, 2017
Professor Karen Yeats has been awarded a Tier 2 Canada Research Chair (CRC) in Combinatorics of Quantum Field Theory.
- Oct. 23, 2017
Professor Fan Chung Graham was awarded an honorary doctorate in mathematics (D.Math.) at the October 20 convocation ceremony at the University of Waterloo.
- Oct. 19, 2017
Eight C&O graduate students were awarded their degrees at the Fall 2017 convocation ceremony.
- Nov. 22, 2017
Title: Alternating Direction Method of Multipliers for the SDP Relaxation of the Quadratic Assignment Problem
Speaker: Henry Wolkowicz Affiliation: University of waterloo Room: MC 5479
The semidefinite programming (SDP) relaxation has proven to be extremely strong for many hard discrete optimization problems. This is in particular true for the quadratic assignment problem (QAP), arguably one of the hardest NP-hard discrete optimization problems.
- Nov. 22, 2017
Title: Sum-of-Squares Proofs in Optimization
Speaker: Mehdi Karimi Affiliation: University of Waterloo Room: MC 5501
The old concept of sum-of-squares found its way into optimization and even machine learning. I will talk about this quickly evolving research area known as convex algebraic geometry.
- Nov. 23, 2017
Title: Orientations, Pseudoforests, Flows, and the Densest Subgraph
Speaker: Markus Blumenstock Affiliation: University of Mainz, Germany Room: MC 6486
Given an undirected graph, consider the problem of finding an orientation such that the max-imum indegree is minimized. The Gabow-Westermann algorithm can solve it by exploiting the matroid structure of pseudoforests.