Modern Techniques in Discrete Optimization: Mathematics, Algorithms and Applications
Videos from CMO Workshop
Antoine Deza, McMaster University
Monday Nov 2, 2015 10:38 - 11:04
Antoine Deza: On the diameter of lattice polytopes
Gabriela Araujo, UNAM
Monday Nov 2, 2015 11:15 - 11:43
The cage problem
Walter D. Morris Jr., George Mason University
Monday Nov 2, 2015 12:03 - 12:33
A directed Steinitz theorem for oriented matroid programming
Shabbir Ahmed, Georgia Institute of Technology
Monday Nov 2, 2015 12:50 - 13:20
Exact Augmented Lagrangian Duality in Mixed Integer Linear Programming
Criel Merino, National Autonomous University of Mexico
Tuesday Nov 3, 2015 10:30 - 10:56
On zeros of the characteristic polynomial of representable matroids of bounded tree-width.
Tamon Stephen, Simon Fraser University
Tuesday Nov 3, 2015 11:15 - 11:45
Polyhedral aspects of circuit-based pivoting algorithms
Alejandro Toriello, Georgia Institute of Technology
Tuesday Nov 3, 2015 12:00 - 12:26
Relaxations for a Dynamic Knapsack Problem
Dorit Hochbaum, UC Berkeley
Tuesday Nov 3, 2015 12:45 - 13:30
Effective combinatorial algorithms for image segmentation and data mining
Thomas Rothvoss, University of Washington
Tuesday Nov 3, 2015 19:15 - 20:14
Constructive discrepancy minimization for convex sets
Amitabh Basu, Johns Hopkins
Wednesday Nov 4, 2015 09:00 - 09:58
An introduction to cut generating functions
Roger Rios, UANL
Wednesday Nov 4, 2015 10:30 - 11:01
Districting Problems: Models, Algorithms and Research Trends
Francisco J. Zaragoza, UAM Azcapotzalco
Wednesday Nov 4, 2015 11:15 - 11:36
Traveling Repairman Problem on a Line with Unit Time Windows
Juan Pablo Vielma, MIT
Wednesday Nov 4, 2015 18:45 - 19:15
Embedding Formulations, Complexity and Representability for Unions of Convex Sets
Sebastian Pokutta, Georgia Tech
Thursday Nov 5, 2015 09:00 - 10:00
Extended formulations: the impressive power of LPs and SDPs
Justo Puerto, Universidad de Sevilla
Thursday Nov 5, 2015 10:30 - 10:58
New results on k-sum and ordered median combinatorial optimization problems
Oktay Gunluk, IBM
Thursday Nov 5, 2015 11:00 - 11:31
Cutting planes from extended LP formulations
Kurt Anstreicher, University of iowa
Thursday Nov 5, 2015 11:35 - 12:00
Kronecker Product Constraints for Semidefinite Optimization
Santanu Dey, Georgia Tech
Thursday Nov 5, 2015 12:00 - 12:36
Analysis of sparse cutting-plane for sparse MILPs with applications to stochastic MILPs
Matthias Koeppe, University of California, Davis, Department of Mathematics
Friday Nov 6, 2015 13:00 - 13:40
Gomory-Johnson’s group relaxation: Algorithmic aspects
