| 8:00 - 9:00 |
Breakfast |
| Survey IX: (Chair: Toshihide Ibaraki) |
| 9:00 - 9:50 |
David Williamson: Approximation algorithms |
| 9:50 - 10:10 |
Coffee break |
| Survey X: (Chair: Toshihide Ibaraki) |
| 10:10 - 11:00 |
Dorit Hochbaum: A unified technique for approximation algorithms for integer programs with three variables per inequality |
| 11:00 - 11:20 |
Coffee break |
| Survey XI: (Chair: Toshihide Ibaraki) |
| 11:20 - 12:10 |
András Recski: Combinatorics of grid-like frameworks |
| |
| 12:10 - 2:00 |
Lunch break |
| Survey XII: (Chair: Egon Balas) |
| 2:00 - 2:50 |
Jim Orlin: Neighborhood search made difficult (with Ravi Ahuja) |
| 2:50 - 3:10 |
Coffee break |
| Survey XIII: (Chair: Egon Balas) |
| 3:10 - 4:00 |
Fred Glover: Tabu search and evolutionary methods: unexpected developments (with Gary Kochenberger) |
| 4:00 - 4:15 |
Coffee break |
| Communications B: (Chair: Jim Orlin) |
| 4:15 - 4:30 |
Friedrich Eisenbrand: A note on the membership problem for the elementary closure of a polyhedron |
| 4:30 - 4:45 |
Jeff Linderoth: Issues in parallel branch and price (with Martin W.P. Savelsbergh) |
| 4:45 - 5:00 |
Kazuhise Makino: Partial and multiple transversals (with Endre Boros, Vladimir Gurvich and Leo Khachiyan) |
| 5:00 - 5:15 |
Coffee break |
| Communications C: (Chair: Leo Khachiyan) |
| 5:15 - 5:30 |
Andrea Grosso: Finding the Paretian solutions for the total and maximum tardiness one-machine scheduling problem (with Federico Della Croce and Roberto Tadei) |
| 5:30 - 5:45 |
Stephen Hill: An application of branch and cut to open pit mine scheduling (with Louis Caccetta) |
| 5:45 - 6:00 |
Stefan Tschoeke: Solving the weekly and the fully-dated fleet assignment problem for large airlines |
| 6:00 - 6:15 |
Guochuan Zhang: On-line algorithms for minimizing Makespan on a single batch processing machine with dynamic job arrivals (with Xiaoqiang Cai and C.K. Wong) |