Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Walrand, Jean
1990.
Stochastic Models.
Vol. 2,
Issue. ,
p.
519.
Weishaupt, Jürgen
1993.
Operations Research ’92.
p.
90.
Tsitsiklis, J.N.
1993.
A short proof of the Gittins index theorem.
p.
389.
Friis, Svend-Holger
Rieder, Ulrich
and
Weishaupt, J�rgen
1993.
Optimal control of single-server queueing networks.
ZOR - Methods and Models of Operations Research,
Vol. 37,
Issue. 2,
p.
187.
Papadimitriou, C.H.
and
Tsitsiklis, J.N.
1994.
The complexity of optimal queueing network control.
p.
318.
Bertsimas, D.
Paschalidis, I.C.
and
Tsitsiklis, J.N.
1994.
Branching bandits and Klimov's problem: achievable region and side constraints.
Vol. 1,
Issue. ,
p.
174.
Weiss, Gideon
1995.
Stochastic Networks.
Vol. 71,
Issue. ,
p.
91.
Bertsimas, D.
Paschalidis, I.C.
and
Tsitsiklis, J.N.
1995.
Branching bandits and Klimov's problem: achievable region and side constraints.
IEEE Transactions on Automatic Control,
Vol. 40,
Issue. 12,
p.
2063.
Bertsimas, Dimitris
1995.
The achievable region method in the optimal control of queueing systems; formulations, bounds and policies.
Queueing Systems,
Vol. 21,
Issue. 3-4,
p.
337.
Liu, Zhen
Nain, Philippe
and
Towsley, Don
1995.
Sample path methods in the control of queues.
Queueing Systems,
Vol. 21,
Issue. 3-4,
p.
293.
Glazebrook, K. D.
Kulkarni, V. G.
and
Puryear, L. C.
1998.
Optimal scheduling of reader—systems.
Naval Research Logistics (NRL),
Vol. 45,
Issue. 5,
p.
483.
Righter, Rhonda
and
Shanthikumar, J. George
1998.
Independently Expiring Multiarmed Bandits.
Probability in the Engineering and Informational Sciences,
Vol. 12,
Issue. 4,
p.
453.
Papadimitriou, Christos H.
and
Tsitsiklis, John N.
1999.
The Complexity of Optimal Queuing Network Control.
Mathematics of Operations Research,
Vol. 24,
Issue. 2,
p.
293.
Bertsimas, Dimitris
and
Niño-Mora, José
2000.
Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic.
Operations Research,
Vol. 48,
Issue. 1,
p.
80.
Crosbie, J. H.
and
Glazebrook, K. D.
2000.
Index Policies and a Novel Performance Space Structure for a Class of Generalised Branching Bandit Problems.
Mathematics of Operations Research,
Vol. 25,
Issue. 2,
p.
281.
Chen, Hong
and
Yao, David D.
2001.
Fundamentals of Queueing Networks.
Vol. 46,
Issue. ,
p.
337.
Dunn, R. T.
and
Glazebrook, K. D.
2001.
The performance of index-based policies for bandit problems with stochastic machine availability.
Advances in Applied Probability,
Vol. 33,
Issue. 2,
p.
365.
Niño-Mora, José
2001.
Encyclopedia of Optimization.
p.
2541.
Altman, Eitan
2002.
Handbook of Markov Decision Processes.
Vol. 40,
Issue. ,
p.
489.
Yao, David D.
2002.
Performance Evaluation of Complex Systems: Techniques and Tools.
Vol. 2459,
Issue. ,
p.
89.