James B. Orlin

Faculty

James B. Orlin

About

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.

Honors

Jim Orlin wins Test of Time Award

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

Publications

"Maximum Flows."

Orlin, James B., and Ravindrah K. Ahuja. In Handbook of Discrete and Combinatorial Mathematics, edited by Kenneth H. Rosen, 759-768. Boca Raton, FL: CRC Press, 2018.

"Minimum Cost Flows."

Orlin, James B., and Ravindrah K. Ahuja. In Handbook of Discrete and Combinatorial Mathematics, edited by Kenneth H. Rosen, 769-778. Boca Raton, FL: CRC Press, 2018.

"Minimum Spanning Trees."

Orlin, James B, and Ravindra K. Ahuja. In Handbook of Discrete and Combinatorial Mathematics, edited by Kenneth H. Rosen, 726-732. Boca Raton, FL: CRC Press, 2018.

"Shortest Paths."

Orlin, James B., and Ravindrah K. Ahuja. In Handbook of Discrete and Combinatorial Mathematics, edited by Kenneth H. Rosen, 748-758. Boca Raton, FL: CRC Press, 2018.

Load More