Abstracts invited presentations
The traveling salesman problem (Tuesday 15.15
- 16.00)
For postscript file click here
Optimization
via branch decomposition
(Wednesday 16.45 - 17.30)
For postscript file of abstract click here
| Back to home page | Program |
LISA K. FLEISCHER
Network
connectivity: approximation algorithms via iterative rounding, part I
For postscript file of abstract click here
Network
connectivity: approximation algorithms via iterative rounding, part II (Wednesday
12.15 - 13.00)
For postscript file of abstract click here
| Back to home page | Program |
THEODORE P. HILL
Recent applications of Benford's law
(Tuesday 16.15 - 17.00)
For postscript file of abstract click here
Constructions of
random probability distributions
For postscript file of abstract click here
| Back to home page | Program |
MARTIN I. REIMAN
A Comparison of two heavy traffic regimes; part I: Multiserver queues
For postscript file of abstract click here
A comparison of two heavy traffic regimes; part II: Multiserver queueing networks(Wednesday 15.45 - 16.30)
Derivative free
optimization: without and with constraints Presolving in quadratic and linear programming
For postscript file of abstract click here
Back to home page
Program
For postscript file of abstract click here
For postscript file of abstract click here
Back to home page
Program