Professor of Mathematics for Operational Research
Research Interests: Mathematics for operational research and systems, models in telecommunications and operations management, control of queues, stochastic networks, on-line bin-packing, ergodicity of markov processes, optimal search, stochastic scheduling, dynamic resource allocation, financial mathematics
Publications
Measurement-Based Usage Charges in Communications Networks
– Operations Research
(2000)
48,
535
(DOI: 10.1287/opre.48.4.535.12424)
Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
– SIAM Journal on Discrete Mathematics
(2000)
13,
384
(DOI: 10.1137/s0895480197325936)
A study of simple usage-based charging schemes for broadband networks.
– Telecommunication Systems
(2000)
15,
323
(DOI: 10.1023/a:1019103214455)
On the sum-of-squares algorithm for bin packing
– Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00
(2000)
208
(DOI: 10.1145/335305.335331)
A self organizing bin packing heuristic
– ALGORITHM ENGINEERING AND EXPERIMENTATION
(1999)
1619,
246
Models and algorithms for planning and scheduling problems: Cambridge Workshop
(1999)
Monotone optimal policies for left-skip-free Markov decision processes
(1999)
19,
191
A study of simple usage-based charging schemes for broadband networks.
– Broadband Communications
(1998)
121,
209
Optimal robot scheduling for web search engines
– Journal of Scheduling
(1998)
1,
15
Bin packing with discrete item sizes .2. Tight bounds on first fit
– Random Struct. Algorithms
(1997)
10,
69
- <
- 3 of 8