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
8:30 - 9:15 Check-In/Breakfast (Hosted by IPAM)
9:15 - 9:30 Welcome and Opening Remarks
9: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 (IBM Thomas J. Watson Research Center)

Local search vs. LP for Matroid Matching

12:00 - 2:00 Lunch (on your own)

Afternoon Session
2:00 - 2:50
Amitabh Basu (University of California, Davis (UC Davis))

Recent trends in Cutting Planes for Mixed-Integer Linear Programs

3:00 - 3:15 Break
3:15 - 4:05
4:15 - 4:30 Break
4:30 - 5:20
Bill Cook (Georgia Institute of Technology)

Use of LP Bounds in Discrete Optimization

5:30 - 7:30 Reception and Poster Session (Hosted by IPAM)

Wednesday, October 27, 2010

Morning Session
8:30 - 9:30 Continental Breakfast
9: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

12:00 - 2:00 Lunch (on your own)

Afternoon Session
2:00 - 2:50
3:00 - 3:15 Break
3:15 - 4:05
Sanjeev Khanna (University of Pennsylvania)

Perfect Matchings in Regular Bipartite Graphs

4:15 - 4:30 Break
4:30 - 5:20
Elad Hazan (Technion - Israel Institute of Technology)

Sublinear time algorithms for classification


Thursday, October 28, 2010

Morning Session
8:30 - 9:30 Continental Breakfast
9: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

12:00 - 2:00 Lunch (on your own)

Afternoon Session
2:00 - 2:50
Franz Rendl (Universität Klagenfurt)

An SDP approach to ordering problems

3:00 - 3:15 Break
3:15 - 4:05
Rekha Thomas (University of Washington)

General Lifts of Polytopes

4:15 - 4:30 Break
4:30 - 5:20

To Be Announced

Friday, October 29, 2010

Morning Session
8:30 - 9:30 Continental Breakfast
9:30 - 10:20
10:30 - 11:00 Break
11:00 - 11:50
12:00 - 2:00 Lunch (on your own)

Afternoon Session
2:00 - 2:50
3:00 - 3:15 Break
3:15 - 4:05
Harald Räecke (University of Warwick)

An Almost Tight Bound for Reordering Buffer Management

4:15 - 4:30 Break
4:30 - 5:20
Prasad Raghavendra (Georgia Institute of Technology)

Approximating Graph Expansion: Connections, Algorithms and Reductions.