|
Abstracts invited presentationsThe traveling salesman problem (Tuesday 15.15
- 16.00)
Optimization
via branch decomposition
(Wednesday 16.45 - 17.30)
LISA K. FLEISCHER Network
connectivity: approximation algorithms via iterative rounding, part I Network
connectivity: approximation algorithms via iterative rounding, part II (Wednesday
12.15 - 13.00)
THEODORE P. HILL Recent applications of Benford's law
(Tuesday 16.15 - 17.00) Constructions of
random probability distributions
MARTIN I. REIMAN A Comparison of two heavy traffic regimes; part I: Multiserver queues
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 |