Complexity of optimal queuing network control

Mathematics of Operations Research

Volumn 24, Issue 2, 1999, Pages 293-305

  Papadimitriou, Christos H ^a,b   Tsitsiklis, John N ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMAL CONTROL SYSTEMS; OPTIMIZATION; POLYNOMIALS; THEOREM PROVING;

BANDIT PROBLEM; CONJECTURE;

QUEUEING NETWORKS;

EID: 0032628612     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.24.2.293     Document Type: Article

References (16)

1. Bertsimas, D., I. C. Paschalidis, J. N. Tsitsiklis 1994. Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance. Ann. Appl. Probab. 4 43-75.
2. Chandra, A., D. Harel, D. Kozen 1981. Alternation. J. Assoc. Comput. Mach. 28 114-133.
3. Fischer, M. J., M. O. Rabin 1974. Super-exponential complexity of Presburger arithmetic. R. M. Karp, ed. Complexity of Computation. SIAM-AMS Symposia in Applied Mathematics.
4. Gittins, J. C. 1989. Multi-Armed Bandit Allocation Indices. Wiley, New York.
5. Harrison, J. M. 1985. Brownian Motion and Stochastic Flow Systems, Prentice Hall, Englewood Cliffs, NJ.
6. Klimov, G. P. 1974. Time sharing service systems I. Theory Probab. Appl. 19 532-551.
7. Kumar, S., P. R. Kumar 1994. Performance bounds for queuing networks and scheduling policies. IEEE Trans. Automat. Control 39 1600-1611.
8. Puterman, M. L. 1994. Markov Decision Processes. Wiley, New York.
9. Papadimitriou, C. H. 1985. Games against nature. Proc. of the 24th FOCS Conf. 446-450; also J. Comput. Systems Sci. 31 288-301.
10. Papadimitriou, C. H. 1985. Games against nature. Proc. of the 24th FOCS Conf. 446-450; also J. Comput. Systems Sci. 31 288-301.
11. _ 1994. Computational Complexity. Addison Wesley, Reading, MA.
12. Stockmeyer, L. J., A. R. Meyer 1973. Word problems requiring exponential time. Proc. of the 5th STOC Conf. 1-9.
13. Walrand, J. 1988. An Introduction to Queueing Networks. Prentice Hall, Englewood Cliffs, New Jersey.
14. Weiss, G. 1988. Branching bandit processes. Probab. Engin. Inf. Sci. 2 269-278.
15. Weber, R. R., G. Weiss 1991. On an index policy for restless bandits. J. Appl. Probab. 27 637-648; addendum in 23 429-430.
16. Whittle, P. 1988. Restless bandits. J. Appl. Probab. 25A 301-313.