Papadimitriou, C. H., & Tsitsiklis, J. N. (1999). THE COMPLEXITY OF OPTIMAL QUEUING NETWORK CONTROL. Mathematics of Operations Research (INFORMS), 24(2), 293. https://doi.org/10.1287/moor.24.2.293
Chicago Style (17th ed.) CitationPapadimitriou, Christos H., and John N. Tsitsiklis. "THE COMPLEXITY OF OPTIMAL QUEUING NETWORK CONTROL." Mathematics of Operations Research (INFORMS) 24, no. 2 (1999): 293. https://doi.org/10.1287/moor.24.2.293.
MLA (9th ed.) CitationPapadimitriou, Christos H., and John N. Tsitsiklis. "THE COMPLEXITY OF OPTIMAL QUEUING NETWORK CONTROL." Mathematics of Operations Research (INFORMS), vol. 24, no. 2, 1999, p. 293, https://doi.org/10.1287/moor.24.2.293.
Warning: These citations may not always be 100% accurate.