Title: On the Adaptivity Gap of Stochastic OrienteeringSpeaker: Paul Lawrence Affiliation: University of Waterloo Location: MC 6029, please contact Rian Neogi for Zoom link
Abstract: This talk highlights the stochastic orienteering problem, in which we are given a budget B and a graph G=(V,E) with edge distances d(u,v) and a starting vertex x. Each vertex v represents a job with a deterministic reward and a random processing time, drawn from a known distribution.
TItle: A perfect graph, a sparse, symmetric matrix and a homogeneous cone walk into a bar … together??Speaker: Levent Tuncel Affiliation: University of Waterloo Location: MC 5501
Abstract: The talk title above sounds like the beginning of a corny joke; however, in this talk, we will indeed utilize results from a very large number of research areas. Many of these research areas are directly within Combinatorics and Optimization and some are from other areas covered in the rest of the Faculty of Mathematics.