Combinatorial Optimization Research Center


Tuesday, November 12, 2002

9:30 AM, Schapiro 412 (Davis Auditorium)


9:30:   Opening Remarks - Donald Goldfarb
        IEOR Department, Columbia University

9:45 - 10:15:    Gerard Cornuejols, CMU
       "Recent Advances in Cutting Plane Theory"

10:25 - 10:55:   Peter Winkler, Bell Labs
       "Graph Coloring and Optical Networks"

Coffee Break

11:15 - 11:45:   Steve Wright, Wisconsin
       "Solving Stochastic Optimization Problems on Computational Grids"

11:55 - 12:25:   Mikkel Thorup, AT&T Research
       "Load Optimal MPLS Routing With N+M Labels"


2:30 - 3:00:   Zonghao Gu, Cplex
       "Quadratic Programming and Mixed Integer Quadratic Programming: Algorithms and Implementation"

3:10 - 3:40:   Andy Conn, IBM
       "Error estimates and poisedness in multivariate polynomial interpolation and derivative-free optimization"

Coffee Break

4:00 - 4:30:   David Shmoys, Cornell
       "Approximation algorithms for facility location and network design problems"

4:40 - 5:10:   Robert Weismantel, Uni. Magdeburg
       "From Integral Bases to an Integer Programming Algorithm"

5:20 - 5:50:   Maria Chudnovsky, Princeton University
       "Strong Perfect Graph Theorem"

The talks will be followed by an Optimization Roundtable

Conference Home