Workshop III: Discrete Optimization - IPAM

Workshop III: Discrete Optimization

Part of the Long Program Modern Trends in Optimization and Its Application
October 26 - 29, 2010

Schedule

All times in this Schedule are Pacific Time (PT)

Tuesday, October 26, 2010

Morning Session

08:30-09:15
Check-In/Light Breakfast (Hosted by IPAM)
09:15-09:30
Welcome and Opening Remarks
09:30-10:20
Shmuel Onn (Technion - Israel Institute of Technology)
The Graver Complexity of Integer Programming
10:30-11:00
Break
11:00-11:50
Jon Lee (University of Michigan)
Local search vs. LP for Matroid Matching

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-14:50
Amitabh Basu (University of California, Davis (UC Davis))
Recent trends in Cutting Planes for Mixed-Integer Linear Programs
15:00-15:15
Break
15:15-16:05
Susan Margulies (Rice University)
On the Nullstellensatz Method for Combinatorial Optimization
16:15-16:30
Break
16:30-17:20
Bill Cook (University of Waterloo)
Use of LP Bounds in Discrete Optimization
17:30-19:30
Reception and Poster Session (Hosted by IPAM)

Wednesday, October 27, 2010

Morning Session

08:30-09:30
Continental Breakfast
09:30-10:20
Maria Chudnovsky (Columbia University)
Vertex-disjoint paths in tournaments
10:30-11:00
Break
11:00-11:50
Volker Kaibel (Otto-von-Guericke-Universität Magdeburg)
Projections in Combinatorial Optimization

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-14:50
Nick Harvey (University of Waterloo)
Graph Sparsification by Edge-Connectivity and Random Spanning Trees
15:00-15:15
Break
15:15-16:05
Sanjeev Khanna (University of Pennsylvania)
Perfect Matchings in Regular Bipartite Graphs
16:15-16:30
Break
16:30-17:20
Elad Hazan (Google DeepMind)
Sublinear time algorithms for classification

Thursday, October 28, 2010

Morning Session

08:30-09:30
Continental Breakfast
09:30-10:20
András Sebő (CNRS, Laboratoire G-SCOP)
Gaps in Graphs and Bins
10:30-11:00
Break
11:00-11:50
Bruce Shepherd (McGill University)
Robust Network Design for General Polytopes

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-14:50
Franz Rendl (Universität Klagenfurt)
An SDP approach to ordering problems
15:00-15:15
Break
15:15-16:05
Rekha Thomas (University of Washington)
General Lifts of Polytopes
16:15-16:30
Break
16:30-17:20
()
Title not available

Friday, October 29, 2010

Morning Session

08:30-09:30
Continental Breakfast
09:30-10:20
Satyen Kale (Yahoo! Research)
Combinatorial Approximation Algorithms for MaxCut using Random Walks
10:30-11:00
Break
11:00-11:50
Santanu Dey (Georgia Institute of Technology)
On the Polyhedrality of Elementary Cutting Plane Closures of Convex Sets.

Afternoon Session

12:00-14:00
Lunch (on your own)
14:00-14:50
Mohit Singh (McGill University)
Improving Integrality Gaps via Chvatal-Gomory Rounding
15:00-15:15
Break
15:15-16:05
Harald Räecke (University of Warwick)
An Almost Tight Bound for Reordering Buffer Management
16:15-16:30
Break
16:30-17:20
Prasad Raghavendra (Georgia Institute of Technology)
Approximating Graph Expansion: Connections, Algorithms and Reductions.
Printable Version