American Psychological Association 6th edition

BERTSIMAS, D., & GAMARNIK, D. (1999). Asymptotically optimal algorithms for job shop scheduling and packet routing. Journal of Algorithms (Print), 33(2), 296-318.

ISO-690 (author-date, English)

BERTSIMAS, D and GAMARNIK, D, 1999. Asymptotically optimal algorithms for job shop scheduling and packet routing. Journal of algorithms (Print). 1 January 1999. Vol. 33, no. 2, p. 296-318.

Modern Language Association 9th edition

BERTSIMAS, D., and D. GAMARNIK. “Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing”. Journal of Algorithms (Print), vol. 33, no. 2, Jan. 1999, pp. 296-18.

Mohr Siebeck - Recht (Deutsch - Österreich)

BERTSIMAS, D/GAMARNIK, D: Asymptotically optimal algorithms for job shop scheduling and packet routing, Journal of algorithms (Print) 1999, 296-318.

Emerald - Harvard

BERTSIMAS, D. and GAMARNIK, D. (1999), “Asymptotically optimal algorithms for job shop scheduling and packet routing”, Journal of Algorithms (Print), Vol. 33 No. 2, pp. 296-318.

Warning: These citations may not always be 100% accurate.