Welcome to Combinatorics and Optimization
Spring 2020 Undergraduate Research Assistantship Program (URA). ***ON-LINE APPICATIONS OPEN November 1, 2019.***
The very successful Tutte's 100th Distinguished Lecture Series has now completed. That success has led to a Tutte Distinguished Lecture once per term. The next lecture will happen in the Spring term.
*Recordings of occurred talks are all available on C&O's YouTube Channel.
New Deadline: February 1, '20
- Nov. 14, 2019
C&O Professor Levent Tuncel has been awarded a five-year Faculty of Mathematics Research Chair. The award recognizes Levent's exceptional scholarly achievements and pre-eminence in the field of optimization.
- Nov. 7, 2019
The book, written by Colin Boyd, Anish Mathuria and C&O Professor Douglas Stebila, is the most comprehensive and integrated treatment of the protocols required for authentication and key establishment.
- Oct. 25, 2019
The Office of Alumni Affairs recognizes top graduating students for academic achievement by awarding medals to one master's student and one doctoral student at Fall convocation.
- Nov. 21, 2019
Title: Kummer's Theorem on binomial coefficients, etc.
Speaker: John Schanck Affiliation: University of Waterloo Room: MC 5501
Some of us like the primes and call ourselves pure mathematicians. Some of us like the Catalan numbers and call ourselves combinatorialists.
- Nov. 22, 2019
Title: Submodular function maximization via the multilinear relaxation and contention resolution schemes
Speaker: Sharat Ibrahimpur Affiliation: University of Waterloo Room: MC 5417
I will present a general framework for maximizing a nonnegative submodular set function $f$ subject to a variety of packing type constraints including multiple matroid constraints, knapsack constraints, and their intersections.
- Nov. 22, 2019
Title: Disjunctive Cuts through the V-Polyhedral Lens
Speaker: Aleksandr Kazachkov Affiliation: Polytechnique Montréal Room: MC 5501
Cutting planes, or cuts, are a critical component of modern integer programming solvers, but existing cuts implemented in solvers are relatively simple compared to those in the literature. We discuss the primary reasons for this disparity, as well as our recently-proposed V-polyhedral framework for mitigating some of these difficulties encountered by prior "stronger" cuts.