Subject: The Program of DO'99

From: "Peter L. Hammer" <[email-masked]>
Date: Thu, 8 Jul 1999 13:03:01 +0005

To:	All participants of DO'99

From:     Endre Boros and Peter Hammer

Re:	The Program

We are happy to enclose the program of DO'99.  We hope you like it; 
as far as we go, we are delighted with it.

We will be in touch with you very shortly for matters concerning 
publications, the logistics for getting to RUTCOR and how to 
survive during DO'99 (breakfast, etc.).  Please watch your email.

For possible changes in the program and for much additional
information (campus maps, directions, etc.), please consult our 
website at    http://rutcor.rutgers.edu/~do99

Do Well!  DO'99
==================================

DISCRETE OPTIMIZATION `99

July 25 - 30, 1999

A DIMACS-RUTCOR Workshop at Rutgers University

Preliminary Program

--------------------------------------------
Sunday, July 25th

1:00 - 3:00	Registration

3:00 - 3:10	Opening

Survey I:
3:10 - 4:00	Tom Magnanti: Network design

4:00 - 4:15	Coffee break

Survey II:
4:15 - 5:05	Egon Balas: Lift-and-project: progress and some open questions

5:05 - 5:20	Coffee break

Survey III:
5:20 - 6:10	Paolo Toth: Vehicle routing

6:10 - 7:30	Reception

--------------------------------------------
Monday, July 26th

8:00 - 9:00	Breakfast

Survey IV:
9:00 - 9:50	Peter Brucker: Complex scheduling problems

9:50 - 10:10	Coffee break

Survey V:
10:10 - 11:00	Toshihide Ibaraki: Graph connectivity and its augmentation

11:00 - 11:20	Coffee break

Survey VI:
11:20 - 12:10	Alan Hoffman: Greedy algorithms in linear programming problems

12:10 - 2:00	Lunch break

Survey VII:
2:00 - 2:50	Silvano Martello: Bin packing problems in two and three dimensions

2:50 - 3:10	Coffee break

Survey VIII:
3:10 - 4:00	Gerard Cornuéjols: Ideal clutters

4:00 - 4:30	Coffee break

Communications A:
4:30 - 4:45	Ralf Keuthen:  New side constraints for the travelling salesman problem arising in printed circuit board assembly (with E.K. Burke and P. Cowling)
4:45 - 5:00	Eva K. Lee: Integer programming models and computational experience in planning implants of radionuclides for the treatment of prostate cancer
5:00 - 5:15	Andrea Lodi: A branch-and-cut algorithm for the multiple depot vehicle scheduling problem (with Matteo Fischetti and Paolo Toth)
5:15 - 5:30	Marco Lübbecke: On combinatorially restricted pickup and delivery paths
5:30 - 5:45	Norbert Radics: Rigidity of t-story buildings

--------------------------------------------
Tuesday, July 27th

8:00 - 9:00	Breakfast

Survey IX:
9:00 - 9:50	David Williamson: Approximation algorithms

9:50 - 10:10	Coffee break

Survey X:
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:
11:20 - 12:10	András Recski: Combinatorics of grid-like frameworks

12:10 - 2:00	Lunch break

Survey XII:
2:00 - 2:50	Jim Orlin: Neighborhood search made difficult (with Ravi Ahuja)

2:50 - 3:10	Coffee break

Survey XIII:
3:10 - 4:00	Fred Glover: Tabu search and evolutionary methods: unexpected developments (with Gary Kochenberger)

4:40 - 4:15	Coffee break

Communications B:
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	Gábor Pataki: Computing with lift-and-project (with Sebastian Ceria)

5:00 - 5:15	Coffee break

Communications C:
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)

--------------------------------------------
Wednesday, July 28th

8:00 - 9:00	Breakfast

Survey XIV:
9:00 - 9:50	Henry Wolkowicz: Semi-definite programming for discrete optimization

9:50 - 10:10	Coffee break

Survey XV:
10:10 - 11:00	Yves Crama: Optimization models in production planning 

11:00 - 11:20	Coffee break

Survey XVI:
11:20 - 12:10	Bernhard Korte: Gigahertz-processors need discrete optimization

12:10 - 2:30	Lunch break

Communications D:
2:30 - 2:45	Vladimir Deîneko: On permuted Demidenko matrices (with Gerhard J. Woeginger)
2:45 - 3:00	Jorge Riera-Ledesma: The capacitated traveling purchaser problem (with Gilbert Laporte and Juan-José Salazar-Gonzáles)
3:00 - 3:15	Andre Rohe: Computing good solutions for large-scale traveling salesman and matching problems
3:15 - 3:30	David Warme: Solving large instances of geometric Steiner tree problems (with Pawel Winter and M.Zachariasen)
3:30 - 3:45	Coffee break

Communications E:
3:45 - 4:00	Alper Atamtürk: Lifted flow pack facets of the single node fixed-harge flow polytope
4:00 - 4:15	Sharon Aviran: Vertex characterization of partition polytopes of point sets on the plane (with Nissan Lev-Tov, Shmuel Onn and Uriel Rothblum)
4:15 - 4:30	David J. Rader, Jr.: Complexity results for facets of the quadratic 0-1 knapsack polytope

4:30 - 5:00	Coffee break

5:00 - 6:30	Roundtable: Perspectives and trends in Discrete Optimization

6:30 - 7:30	Wine and cheese party

--------------------------------------------
Thursday, July 29th

8:00 - 9:00	Breakfast

Survey XVII:
9:00 - 9:50	Bill Pulleyblank: Hilbert bases, Caratheodory's theorem and integer programming

9:50 - 10:10	Coffee break

Survey XVIII:
10:10 - 11:00	Laurence Wolsey: Survey on mixed integer programming

11:00 - 11:20	Coffee break

Survey XIX:
11:20 - 12:10	Vasek Chvátal: On the solution of traveling salesman problems

12:10 - 2:00	Lunch break

Survey XX:
2:00 - 2:50	Rainer Burkard: Assignment problems

2:50 - 3:10	Coffee break

Survey XXI:
3:10 - 4:00	Jakob Krarup: Locational decisions with friendly and obnoxious facilities (with David Pisinger)

4:00 - 4:30	Coffee break

Communications F:
4:30 - 4:45	Foued Ben Abdelaziz: A parallel metaheuristic for multi-objective knapsack problem (with Talbi El-Ghazali and El Elj Houcine)
4:45 - 5:00	Alexander Bockmayr: Branch-and-Infer: A unifying framework for integer and finite domain constraint (with Thomas Kasper)
5:00 - 5:15	Moshe Dror: Some generalized combinatorial problems (with Mohamed Haouari)
5:15 - 5:30	Andrzej Ruszczynski: Efficient points of discrete distributions in stochastic discrete optimization (with Darinka Dentcheva and András Prékopa)

--------------------------------------------
Friday, July 30th

8:00 - 9:00	Breakfast

Survey XXII:
9:00 - 9:50	Endre Boros: Pseudo Boolean optimization (with Peter L. Hammer)

9:50 - 10:10	Coffee break

Survey XXIII:
10:10 - 11:00	Peter L. Hammer: Boolean optimization (with Endre Boros)

11:00 - 11:15	Coffee break

Communications G:
11:15 - 11:30	Peter Hahn: Branch-and-bound solution of the Krarup 30a instance of the quadratic assignment problem
11:30 - 11:45	Tania Querido: Classes of quadratic assignment problem instances: isomorphism and difficulty measure in a statistical approach (with Nair Maria Maia de Abreau, Paulo Oswaldo Boaventura 11:45 - 12:00	Fabio Tardella: Connections between discrete and continuous optimization problems

12:00 - 1:30	Lunch break

Communications H:
1:30 - 1:45	Gabriela Alexe: Representation of bigraphs connectivity using the maximal biclique structure: approximation algorithms and applications (with Sorin Alexe)
1:45 - 2:00	Eranda Çela: 2-median problem in networks with Pos/Neg weights (with Rainer E. Burkard and Helidon Dollani)
2:00 - 2:15	Vladimir Gurvich: Camel sequences and quadratic residues (with Li Sheng)
2:15 - 2:30	Alexander Kelmans: Packing subgraphs in a graph
2:30 - 2:45	Ephraim Korach: On bicolorings, anticolorings and extensions (with Daniel Kobler and Alain Herz)

2:45 - 3:00	Coffee break

Communications I:
3:00 - 3:15	Andre Kundgen: Covering a graph with cuts of minimum total size (with Zoltán Füredi)
3:15 - 3:30	Vadim E. Levit: The family of local stability systems of a forest (with Eugen Mandrescu)
3:30 - 3:45	Uri N. Peled: Block duplicate graphs and a hierarchy of chordal graphs (with Martin C. Golumbic)
3:45 - 4:00	Herzl Regev: The weight of the greedy graph spanner

4:00 - 4:05	Farewell tea