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

On the Sum-of-Squares algorithm for bin packing
J Csirik, DS Johnson, C Kenyon, JB Orlin, PW Shor, RR Weber
– CoRR
(2006)
53,
1
Optimal Scheduling of Peer-to-Peer File Dissemination
J Mundinger, RR Weber, G Weiss
– CoRR
(2006)
abs/cs/0606110,
On the sum-of-squares algorithm for bin packing
J Csirik, DS Johnson, C Kenyon, JB Orlin, PW Shor, RR Weber
– Proceedings of the Annual ACM Symposium on Theory of Computing
(2000)
208
Bin packing with discrete item sizes, part II: Tight bounds on First Fit
EG Coffman, DS Johnson, PW Shor, RR Weber
– Random Structures and Algorithms
(2000)
10,
69
A study of simple usageā€based charging schemes for broadband networks
C Courcoubetis, FP Kelly, VA Siris, R Weber
– Telecommunication Systems
(2000)
15,
323
Measurement-Based Usage Charges in Communications Networks
C Courcoubetis, F Kelly, R Weber
– Operations Research
(2000)
48,
535
Monotone optimal policies for left-skip-free Markov decision processes
S Stidham, RR Weber
(1999)
19,
191
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)
Optimal robot scheduling for Web search engines
EG Coffman, Z Liu, RR Weber
– Journal of Scheduling
(1998)
1,
15
  • <
  • 5 of 8
  • >