Address
Princeton University
bico@math.princeton.edu
http://www.math.princeton.edu/~bico

Lectures
The Traveling Salesman Problem(Tuesday 15.15 - 16.00)
Click here for postscript file of the abstract
For papers related to the Traveling Salesman Problem: http://www.math.princeton.edu/tsp

Optimization via Branch Decomposition (Wednesday 16.45 - 17.30)
Click here for postscript file of the abstract
 

Short Bio
William Cook received his Ph.D. in Combinatorics and Optimization from the University of Waterloo in 1983.He spent two years as an Alexander von Humboldt Research Fellow at the University of Bonn, and he has held positions at Cornell, Columbia, Bellcore, and Rice, where he was the Noah Harding Professor of Computational and Applied Mathematics.He is currently a Visiting Professor in mathematics at Princeton University. He is the Editor-in-Chief of Mathematical Programming, Series B, and a member of the Editorial Boards of Mathematics of Operations Research, INFORMS Journal on Computing, SIAM Journal of Discrete Mathematics, and Mathematical Programming, Series A.Together with David Applegate, Robert Bixby, and Vasek Chvatal, he was awarded the Beale-Orchard-Hayes Prize by the Mathematical Programming Society (2000) for his work on the traveling salesman problem.
 
 

Address
Graduate School of Industrial Administration
Carnegie Mellon University
Pittsburgh, PA 15213, USA
lkf@andrew.cmu.edu
http://www.gsia.cmu.edu/afs/andrew/gsia/workproc/roster/full-time/fleischer.html

Lectures
Network connectivity: approximation algorithms via iterative rounding, part I(Tuesday 12.00 - 12.45)
Click here for postscript file of the abstract
Click here for a postscript file of the slides of both letures

Network connectivity: approximation algorithms via iterative rounding, part II (Wednesday 16.45 - 17.30)
Click here for postscript file of the abstract
Click here for a postscript file of the slides of both letures

Short Bio
Lisa Fleischer received her Ph. D. in 1997 from the Cornell University. Her teaching and research interests are discrete optimization, approximation algorithms, network routing and design, linear and integer programming. At this moment she is Professor of Operations Research at the Graduate School of Business Administration at Carnegie Mellon University. She has awarded the INFORMS George Nicholson Prize 1998, the NSF International Fellow Postdoctoral Award 1999 and the NSF Career Award 2000-2004. She is consultant of Lucent Technologies and Sandia National Laboratories. Since 2000 she is a member of the Editorial Board of Operations Research.
 
 

Address
Georgia Institute of Technology
School of Mathematics
Atlanta, GA 30332-0160, USA
hill@math.gatech.edu
http://www.math.gatech.edu/~hill

Lectures
Recent applications of Benford's law (Tuesday 16.15 - 17.00)
Click here for postscript file of the abstract

Constructions of random probability distributions (Wednesday 10.00 - 10.45)
Click here for a postscript file of the abstract

Short Bio
Ted Hill is Professor of Mathematics at the Georgia Institute of Technology. He received his Ph. D. from the University of California, Berkeley, in 1977. During several periods he was visiting professor at universities in USA, Israel, Germany (as Fulbright Scholar and Gauss Professor in Göttingen) and the Netherlands (Leiden University and Free University Amsterdam). He is elected fellow IMS and elected member ISI. He research interest is in applied probability theory: optimal stopping theory, fair-division problems, limit laws and Benford’s law. He received the Best Teaching Award 1990 (from 50 Faculties).
 
 

Address
Bell Laboratories
Lucent Technology
700 Mountain Av.
Murray Hill, NJ 07974-0636, USA
marty@research.bell-labs.com
http://plan9.bell-labs.com/cm/ms/who/marty

Lectures
A comparison of two heavy traffic regimes; part I: Multiserver queues (Wednesday 09.00 - 09.45)
Click here for postscript file of the abstract
Click here for a postscript file of the slides of both letures

A comparison of two heavy traffic regimes; part II: Multiserver queueing networks (Wednesday 15.45 - 16.30)
Click here for a postscript file of the abstract
Click here for a postscript file of the slides of both lectures

Short Bio
Martin I. Reiman received his Ph.D. in Operations Research from Stanford University. His research has focused on the analysis, design and control of queueing systems, with an emphasis on fluid and diffusion limits for these systems. He is an area editor of Mathematics of Operations Research (for the Stochastic Models area), and is an associate editor of the Annals of Applied Probability. He is (co)-author of about 60 papers
 
 

Address
Department of Mathematics
University of Namur (FUNDP)
61, Rue de Bruxelles
B5000 - Namur, Belgium
philippe.toint@fundp.ac.be
http://www.fundp.ac.be/~phtoint

Lectures
Derivative free optimization: constrained and unconstrained approaches (Tuesday 11.00 - 11.45)
Click here for a postscript file of the slides of both lectures

A new tool for the preprocessing of quadratic programs (Wednesday 11.15 - 12.00)
Click here for a postscript file of the slides of both lectures

Short Bio
Philippe Toint is Full Professor at the Department of Mathematics of the University of Namur and director of the Numerical Analysis Research Unit, director of the Transportation Research Group and director of the University Computing Centre. His research interests are: smooth nonlinear optimization (with an emphasis on the algorithmic viewpoint, ranging from convergence theory to numerical considerations and software development); practical and multidisciplinary applications of optimization techniques; analysis of transportation systems, including dynamic traffic modeling and demand estimation, as well as advanced behavioral models; applications in regional, national and European strategic transportation planning. He is vice-president of the SIAM Activity Group on Optimization and Associate Editor of SIAM Journal of Optimization, SIAM Journal of Numerical Analysis, Mathematical Programming, Operations Research and Transportation Sciences. He was awarded, with Conn and Gould, the Beale-Orchard-Hayes Prize 1994 by the Mathematical Programming Society for his work on the LANCELOT package.