Workshop III: Discrete Optimization

October 26 - 29, 2010

Schedule


Tuesday, October 26, 2010

9:30 - 10:20
Shmuel Onn (Technion - Israel Institute of Technology)

The Graver Complexity of Integer Programming

11:00 - 11:50
Jon Lee (IBM Thomas J. Watson Research Center)

Local search vs. LP for Matroid Matching

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

Recent trends in Cutting Planes for Mixed-Integer Linear Programs

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

Use of LP Bounds in Discrete Optimization


Wednesday, October 27, 2010

9:30 - 10:20
Maria Chudnovsky (Columbia University)

Vertex-disjoint paths in tournaments

11:00 - 11:50
Volker Kaibel (Otto-von-Guericke-Universität Magdeburg)

Projections in Combinatorial Optimization

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

Perfect Matchings in Regular Bipartite Graphs

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

Sublinear time algorithms for classification


Thursday, October 28, 2010

9:30 - 10:20
András Sebő (CNRS, Laboratoire G-SCOP)

Gaps in Graphs and Bins

11:00 - 11:50
Bruce Shepherd (McGill University)

Robust Network Design for General Polytopes

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

An SDP approach to ordering problems

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

General Lifts of Polytopes

4:30 - 5:20

To Be Announced


Friday, October 29, 2010

9:30 - 10:20
11:00 - 11:50
2:00 - 2:50
3:15 - 4:05
Harald Räecke (University of Warwick)

An Almost Tight Bound for Reordering Buffer Management

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

Approximating Graph Expansion: Connections, Algorithms and Reductions.