The Complexity of Optimal Queuing Network Control

References

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