8.30 - 8.50 Registration and Breakfast 8.50 - 9.00 Welcome and Greeting 9.00 - 10.00 William Cook, Rice University On the Solution of Traveling Salesman Problems 10.15 - 11.15 Daniel Bienstock, Columbia University Solving aircraft maintentance scheduling problems 11.15 - 11.30 Break 11.30 - 12.30 David Johnson, AT&T Labs - Research The Prize Collecting Steiner Tree problem 2.00 - 3.00 David Shmoys, Cornell University Approximation algorithms via linear programming: rounding algorithms 3.15 - 4.15 Laurence Wolsey, Catholic Univ. of Louvain (Belgium) BC-PROD and LOTSIZELIB 4.15 - 4.30 Break 4.30 - 5.30 Brenda Dietrich, IBM Thomas J. Watson Research Laboratory Optimization in IBM Manufacturing 5:30 - 7.30 Reception 7.30 - 9.30 Panel discussion -- Future researchTuesday, February 9, 1999
8.30 - 9.00 Breakfast and Registration 9.00 - 10.00 David Simchi-Levi, Northwestern University Optimal and Approximation Algorithms for Large Scale Supply Chain Management Problems 10.15 - 11.15 Gilbert Laporte, Centre de Recherche sur les Transports (Montreal) An Overview of Classical and Modern Heuristics for the Vehicle Rotuing Problem 11.15 - 11.30 Break 11.30 - 12.30 Warren Powell, Princeton University Dynamic programming approximations for the discrete multicommodity network flow problem over a dynamic graph 12.30 - 2.00 Lunch 2.00 - 3.00 Tom Magnanti. MIT Painting cars and the traveling salesman problem 3.00 - 3.15 Break 3.15 - 4.15 Mauricio Resende, AT&T Labs - Research GRASP: Greedy randomized adaptive search procedures 4.30 - 5.30 Jimmy Crawford, i2 Technologies AI Techniques for Large-Scale Discrete OptimizationWednesday, February 10, 1999
8.30 - 9.00 Breakfast 9.00 - 10.00 Mike Ball, University of Maryland Optimization Problems in Air Traffic Management 10.00 - 10.15 Break 10.15 - 11.15 Ellis Johnson, Georgia Institute of Technology Airline Integrated Recovery: AIR and SimAIR 11.30 - 12.30 Ravi Ahuja, University of Florida Very Large Scale Neighborhood Search