James B. Orlin


James B. Orlin

Support Staff

Get in Touch



Academic Groups

Academic Area

Centers & Initiatives

James Orlin is the E. Pennell Brooks (1917) Professor in Management and a Professor of Operations Research at the MIT Sloan School of Management.

Orlin specializes in network and combinatorial optimization. He has helped to develop improved solution methodologies in airline scheduling, railroad scheduling, logistics, network design, telecommunications, inventory control, and marketing. Together with MIT Sloan colleague Thomas L. Magnanti and Ravindra K. Ahuja, he has written the award-winning textbook, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, 1993).

Orlin holds a BA in mathematics from the University of Pennsylvania, an MA in mathematics from the California Institute of Technology, an MMath from the University of Waterloo, and a PhD in operations research from Stanford University.


Orlin receives Khachiyan Prize

Jim Orlin wins Test of Time Award

James Orlin is a co-winner of the Leonard G. Abraham Prize


"Directed Shortest Paths via Approximate Cost Balancing."

Orlin, James B., and László A. Végh. Journal of the Association for Computing Machinery. Forthcoming. arXiv Preprint. 2021 Conference Paper.

"Linearizable Special Cases of the Quadratic Shortest Path Problem."

Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, and Lasse Wulf. In Proceedings of the 2021 International Workshop on Graph-Theoretic Concepts in Computer Science, Switzerland: September 2021.

"A Fast Max Flow Algorithm."

Orlin, James B. and Xiaoyue Gong. Networks Vol. 77, No. 2 (2021): 287-321. arXiv Preprint.

"Distributionally Robust Max Flows."

​​Louis L. Chen, Will Ma, James B. Orlin, and David Simchi-Levi. In SIAM Symposium on Simplicity in Algorithms, edited by Inge Li Gørtz and Martin Farach-Colton. 2020.

Load More