Winter 2016 Schedule

On folding pathways, recycling, and reversible programming
Anne Condon   January 18th   4pm   Burnside 1205   abstract
Distributed Optimization for Networked Systems
Soomin Lee   February 8th   4pm   Burnside 1205   abstract
Assortment Optimization Under a General Discrete Choice Model: An Analysis of Revenue-Ordered Assortments
Gerardo Berbeglia   February 12th   3pm   McConnell 103   abstract
Ambiguous Joint Chance Constraints under Mean and Dispersion Information
Grani Adiwena Hanasusanto   February 15th   4pm   Burnside 1205   abstract
Spatial Branch-and-Cut for Polynomial Optimization
Chen Chen   February 17th   4pm   Burnside 1205   abstract
Epi-convergent Smoothing with Applications to Convex Composite Functions
Tim Hoheisel   February 22nd   4pm   Burnside 1205   abstract
Limit Permutations
Peter Winkler   March 21st   4pm   Burnside 1205   abstract
Extremal Bounds for Bootstrap Percolation in the Hypercube
Jonathan Noel   April 4th   4pm   Burnside 1205   abstract
The Turan number of a family of graphs
Tao Jiang   April 25th   4pm   Burnside 1205   abstract
A characterization of functions with vanishing averages over products of disjoint sets
Yaqiao Li   May 2nd   4pm   Burnside 1205   abstract
DMO Homepage