Nemfest Program Thursday May 11, 2017

Time	Session
7:30-8:15	Registration and continental breakfast
8:15–8:30	Welcome/introduction
	Chair: Andy Sun
8:30–9:15	Multi-Block ADMM and its Convergence Yinyu Ye – Stanford University	Abstract
9:15–10:00	Sparse Linear Regression and Optimal Trees using Convex and Mixed Integer Optimization Dimitris Bertsimas – Massachusetts Institute of Technology	Abstract
10:00–10:15	Break
	Chair: Santanu Dey
10:15–11:00	Ideal 0,1 matrices that do not pack Gérard Cornuéjols – Carnegie Mellon University	Abstract
11:00–11:45	Twenty Years of Sports Scheduling With George Mike Trick – Carnegie Mellon University	Abstract
11:45–1:00	Lunch
	Chair: Alejandro Toriello
1:00–1:45	Attacking NP-hard Problems Bill Cook – University of Waterloo	Abstract
1:45–2:30	Bank accounts, submodular set functions, and location problems Karen Aardal – Delft University	Abstract
2:30–2:45	Break
	Chair: David Goldberg
2:45–3:30	Algorithmic Tools for Smooth Nonconvex Optimization Stephen Wright – University of Wisconsin, Madison	Abstract
3:30–4:15	On near-optimality of linear estimation Anatoli Juditsky – Université Joseph Fourier	Abstract
4:15–4:30	Break
	Chair: Natashia Boland
4:30–5:30	Reflections on the work of George Nemhauser Panel: Cindy Barnhart, Martin Grötschel, Bill Pulleyblank, Martin Savelsbergh, Laurence Wolsey
5:30–6:30	Poster session
6:45–7:30	Reception at Ecco (40 7th Street NE, Atlanta)
7:30-	Dinner at Ecco (40 7th Street NE, Atlanta)

Multi-Block ADMM and its Convergence

Sparse Linear Regression and Optimal Trees using Convex and Mixed Integer Optimization

Ideal 0,1 matrices that do not pack

Twenty Years of Sports Scheduling With George

Attacking NP-hard Problems

Bank accounts, submodular set functions, and location problems

Algorithmic Tools for Smooth Nonconvex Optimization

On near-optimality of linear estimation

Reflections on the work of George Nemhauser