Combinatorial Optimization Research Center

1st COLUMBIA OPTIMIZATION DAY

Wednesday, November 28, 2001

9:30 AM, Schapiro 412 (Davis Auditorium)





Program

9:30:   Opening Remarks - Zvi Galil
       Dean, Fu Foundation School of Engineering, Columbia University

9:45 - 10:20:   William Cook, Princeton University
       "Optimization via Branch Decomposition"

10:30 - 11:05:   George Nemhauser, Georgia Tech
       "A Polyhedral Study of the Cardinality Constrained Knapsack Problem"

Coffee Break

11:25 - 12:00:   David Johnson, AT&T Research
       "Heuristics for the Traveling Salesman Problem: The State of the Art"

12:10 - 12:45:   Sebastian Ceria, Axioma
       "Solving integer programs in practice: the Axioma perspective"

Lunch

2:30 - 3:05:   Vasek Chvatal, Rutgers University
       "TSP cuts that do not follow the template paradigm"

3:15 - 3:50:   Francisco Barahona, IBM Research
       "Branch & Cut based on the Volume algorithm"

Coffee Break

4:10 - 4:45:   Bruce Shepherd, Lucent
       "Revisiting the Lucchesi-Younger Theorem"

4:55 - 5:30:   Robert Bixby, Rice University and ILOG Cplex
       "MIP: A Progress Report"

  
The talks will be followed by an Optimization Roundtable:

5:45 - 6:30: "The next 10 years in Discrete Optimization"


Conference Home