James Orlin

James Orlin is the E. Pennell Brooks Professor of Operations Research at the MIT Sloan School. He is best known for his research on obtaining faster algorithms for problems in network and combinatorial optimization and for his text with Ravi Ahuja and Tom Magnanti entitled Network Flows: Theory, Algorithms, and Applications.

He has won various awards for his co-authored publications: the 1993 Lanchester Prize for the best publication in O.R , the 2007 INFORMS Computing Society Prize for research in the interface of O.R. and computer science, the 2008 IEEE Leonard G. Abraham Prize for research in communication theory, the 2011 IEEE Bennett Prize for research in communication theory, the 2016 ACM SIGecom Test of Time Award, for a paper published between 10 and 25 years ago that has had “significant impact on research or applications that exemplify the interplay of economics and computation,” and the 2020 Khachyian prize for lifetime achievements in the area of optimization.
James Orlin is the E. Pennell Brooks Professor of Operations Research at the MIT Sloan School. He is best known for his research on obtaining faster algorithms for problems in network and combinatorial optimization and for his text with Ravi Ahuja and Tom Magnanti entitled Network Flows: Theory, Algorithms, and Applications.

He has won various awards for his co-authored publications: the 1993 Lanchester Prize for the best publication in O.R., the 2007 INFORMS Computing Society Prize for research in the interface of O.R. and computer science, the 2008 IEEE Leonard G. Abraham Prize for research in communication theory, the 2011 IEEE Bennett Prize for research in communication theory, the 2016 ACM SIGecom Test of Time Award, for a paper published between 10 and 25 years ago that has had “significant impact on research or applications that exemplify the interplay of economics and computation,” and the 2020 Khachyian prize for lifetime achievements in the area of optimization.