For a PDF file of the full program, including titles and abstracts, click here.

Selected presentations are now available for download.  
(Speakers, if you have updated slides that you wish to be posted, please send them to the organizers.)

Monday, June 19
9:00-9:45 Registration 
9:45-10:00 Opening Remarks 
10:00-10:45 Miguel Anjos The State-of-the Art of Mathematical Optimization Models for Facility Layout
interested parties can reach out to Miguel Anjos for the presentation file)
10:45-11:15 Break 
11:15-12:00 Christoph Buchheim Mixed-Integer Programming with PDE constraints
12:00-2:00 Lunch 
2:00-2:45 David Bergman Discrete Nonlinear Optimization by State-Space Decompositions
2:45-3:15 Poster Introductions I 
3:15-3:45 Break 
3:45-4:15 Poster Introductions II 
4:15-4:45 Bill Cook Guiding the Cutting-Plane Method
4:45-5:15 Maurice Queyranne Tight MIP Formulations for Unit Commitment and Production Planning Problems with Bounded Up / Down Times
5:30-8:30 Poster Session / Reception 

Tuesday, June 20
 9:30-10:15 Dorit Hochbaum Machine Learning Combinatorial Optimization Algorithms
 10:15-10:45 Break 
 10:45-11:30 Volker Kaibel Descriptions of Spanning Tree Polytopes
 11:30-12:00 Daniel Dadush Solving Linear Programs via Rescalable Geometry
 12:00-2:00 Lunch 
 2:00-2:45 Angelos Georghiou Robust Dual Dynamic Programming
 2:45-3:15 Hassan Hijazi Lazy Cut Generation for Semidefinite Programming
 3:15-3:45 Break 
 3:45-4:15 Sven Wiese New Applications for Wide Split Cuts
 4:15-4:45 Margarida Carvalho An Integer Programming Game in Health-care
 4:45-5:30 Philipp Christophel Shaping and Trimming Branch-and-Bound Trees
 5:30-6:00 Business Meeting 
 6:30-9:00 Conference Dinner

Wednesday, June 21
 9:30-10:15 Yoshua Bengio Deep Learning for AI
 10:15-10:45 Break 
 10:45-11:30 Santanu Dey Using Sparsity to Design Primal Heuristics for Integer Programs: Two Stories
 11:30-12:00 Austin Buchanan Parsimonious Integer Programming Formulations for Low-Diameter Clusters (k-Clubs)
 12:00-2:00 Lunch 
 2:00-2:45 Vahab Mirrokni Distributed Optimization via Composable Core-Sets: From Submodulity to Feature Selection
 2:45-3:15 Louis-Martin Rousseau A First Look at Picking Dual Values for Maximizing Reduced Cost Fixing
 3:15-3:45 Break 
 3:45-4:15 Thorsten Koch SCIP-Jack: A Solver for Steiner Tree Problems in Graphs and Their Relatives
 4:15-4:45 Pierre Bonami Using Machine Learning inside CPLEX
 4:45-5:15 Michael Perregaard How MIP Solvers Can Benefit from Interior Point Solutions

Thursday, June 22
 9:30-10:15 Pablo Parrilo Graph Structure in Polynomial Systems: Chordal Networks
 10:15-10:45 Break 
 10:45-11:15 Sercan Yildiz Polynomial Optimization with Sum-of-Squares Interpolants
 11:15-11:45 Burak Kocuk Extensions of Subadditive Duality For Conic Mixed-Integer Programs
 11:45-12:30 Matthias Koeppe Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems
 12:30-1:00 Poster Prize / Closing Remarks