skip to content

Department of Pure Mathematics and Mathematical Statistics

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
C Courcoubetis, F Kelly, R Weber
– Operations Research
(2000)
48,
535
Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
EG Coffman, C Courcoubetis, MR Garey, DS Johnson, PW Shor, RR Weber, M Yannakakis
– SIAM Journal on Discrete Mathematics
(2000)
13,
384
A study of simple usage-based charging schemes for broadband networks.
C Courcoubetis, FP Kelly, VA Siris, R Weber
– Telecommunication Systems
(2000)
15,
323
On the sum-of-squares algorithm for bin packing
J Csirik, DS Johnson, C Kenyon, JB Orlin, PW Shor, RR Weber
– Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00
(2000)
208
A self organizing bin packing heuristic
J Csirik, DS Johnson, C Kenyon, PW Shor, RR Weber
– 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
S Stidham, RR Weber
(1999)
19,
191
A study of simple usage-based charging schemes for broadband networks.
C Courcoubetis, FP Kelly, VA Siris, RR Weber
– Broadband Communications
(1998)
121,
209
Optimal robot scheduling for web search engines
EG Coffman, Z Liu, RR Weber
– Journal of Scheduling
(1998)
1,
15
Bin packing with discrete item sizes .2. Tight bounds on first fit
EG Coffman, DS Johnson, PW Shor, RR Weber
– Random Struct. Algorithms
(1997)
10,
69
  • <
  • 3 of 8
  • >