James B. Orlin

James B. Orlin is the E. Pennell Brooks (1917) Professor in Management and a Professor of Operations Research at the MIT Sloan School of Management. He specializes in network and combinatorial optimization with applications spanning transportation, computer science, operations, and marketing.

• BA in Mathematics, University of Pennsylvania
• MA in Mathematics, California Institute of Technology
• MMath, University of Waterloo
• PhD in Operations Research, Stanford University

His research focuses on designing efficient algorithms for network optimization problems, including shortest path, max flow, and min cost flow. He has contributed to algorithmic theory in logistics, telecommunications, and inventory management, with work on stochastic demand models and data-driven inventory policies.

Recent publications include advancements in directed shortest path algorithms, robust submodular function maximization, and energy storage problem complexity. His seminal textbook Network Flows: Theory, Algorithms, and Applications (1993) remains a foundational reference.

• Leonard G. Abraham Prize
• Khachiyan Prize
• Test of Time Award

As a mentor, he has advised numerous researchers through collaborative publications and teaching. His work addresses both theoretical algorithm development and practical implementation across diverse domains including airline scheduling, logistics, and network design.