Events

A conference in honour of Bill Cunningham's 65th birthday

Overview

Matroid theory and matching theory are among the oldest and most established areas in combinatorics, so progress in these areas is typically hard won; nevertheless, the recent advances have been spectacular. There is now an efficient algorithm for solving the weighted matroid matching problem for linear matroids.

Things I Did and Things I Wanted to Do

Speaker:	John Dennis
Affiliation:	Rice University
Room:	Mathematics & Computer Building (MC) 5158

Abstract:

Over the course of my career, continuous nonlinear optimization has come into its own as a crucial area of computational and applied mathematics.

Constructing and computing equilibria for two-player games

Speaker:	Bernhard von Stengel
Affiliation:	London School of Economics
Room:	Mathematics & Computer Building (MC) 5158

Abstract:

A bimatrix game is a two-player game in strategic form, a basic model in game theory.

Approximating Minimum Cost Connected T-Joins

Speaker:	Zachary Friggstad
Affiliation:	University of Waterloo
Room:	Mathematics & Computer Building (MC) 5158

Abstract:

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.

Factoring Polynomials over a Finite Field

Speaker:	Bruce Richmond
Affiliation:	University of Waterloo
Room:	Mathematics & Computer Building (MC) 5158

Abstract:

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.

0/1 Polytopes with Quadratic Chvátal Rank

Speaker:	Laura Sanità
Affiliation:	University of Waterloo
Room:	Mathematics & Computer Building (MC) 5158

Abstract:

For a polytope P, the Chvátal closure P'⊆P is obtained by simultaneously strengthening all feasible inequalities cx≤β (with integral c) to cx≤⌊β⌋.

Fast and Robust Algorithms for Separable Nonnegative Matrix Factorization

Speaker:	Levent Tunçel
Affiliation:	University of Waterloo
Room:	Mathematics & Computer Building (MC) 5158

A column generation-based algorithm for Volumetric Modulated Arc Therapy (VMAT) treatment plan optimization

Speaker:	Marina Epelman
Affiliation:	University of Michigan
Room:	Mathematics & Computer Building (MC) 5158

Abstract:

External beam radiation therapy is a common treatment for many types of cancer.

Obtaining Balanced Partitions of Grids using Trees

Speaker:	Levent Tunçel
Affiliation:	University of Waterloo
Room:	Mathematics & Computer Building (MC) 5158

Abstract:

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.

Takin' integer programming (IP) to the streets

Speaker:	Kevin Cheung
Affiliation:	Carleton University
Room:	Mathematics & Computer Building (MC) 5158

Abstract:

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.