Matching, Matroids, and Extensions
A conference in honour of Bill Cunningham's 65th birthday
Overview
Speaker: | John Dennis |
---|---|
Affiliation: | Rice University |
Room: | Mathematics & Computer Building (MC) 5158 |
Over the course of my career, continuous nonlinear optimization has come into its own as a crucial area of computational and applied mathematics.
Speaker: | Bernhard von Stengel |
---|---|
Affiliation: | London School of Economics |
Room: | Mathematics & Computer Building (MC) 5158 |
A bimatrix game is a two-player game in strategic form, a basic model in game theory.
Speaker: | Zachary Friggstad |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics & Computer Building (MC) 5158 |
Given a graph G and a subset of nodes T, a connected T-join is a connected spanning subgraph H such that T is exactly the set of even-degree nodes; H may have multiple copies of any edge of G.
Speaker: | Bruce Richmond |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics & Computer Building (MC) 5158 |
The basic algorithms for factoring polynomials over a finite field go back two hundred years, according to the book Modern Computer Algebra by Joachim von zur Gathen and Jürgen Gerhard.
Speaker: | Laura Sanità |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics & Computer Building (MC) 5158 |
For a polytope P, the Chvátal closure P'⊆P is obtained by simultaneously strengthening all feasible inequalities cx≤β (with integral c) to cx≤⌊β⌋.
Speaker: | Levent Tunçel |
---|---|
Affiliation: | University of Waterloo |
Room: |
Mathematics & Computer Building (MC) 5158 |
Speaker: | Marina Epelman |
---|---|
Affiliation: | University of Michigan |
Room: | Mathematics & Computer Building (MC) 5158 |
External beam radiation therapy is a common treatment for many types of cancer.
Speaker: | Levent Tunçel |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics & Computer Building (MC) 5158 |
We consider the k-balanced partitioning problem, which is defined as follows. Find the minimum number of edges in a graph that, when cut, partition the vertices into k (almost) equally sized sets.
Speaker: | Kevin Cheung |
---|---|
Affiliation: | Carleton University |
Room: | Mathematics & Computer Building (MC) 5158 |
Over the years, powerful software tools been developed to tackle IP problems. IP has applications in many areas: For example, crew scheduling, transportation optimization, supply-chain management etc.