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 expertise in developing improved solution methodologies in airline scheduling, railroad scheduling, logistics, network design, telecommunications, inventory control, and marketing. Orlin has co-authored the award-winning textbook, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, 1993), with MIT Sloan colleagues Thomas L. Magnanti and Ravindra K. Ahuja. He 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.

James B. Orlin is a professor at the Massachusetts Institute of Technology, specializing in algorithms, operations research, and computer science. His research focuses on developing efficient algorithms for network flows, shortest path problems, and minimum cost flow computations. Orlin has contributed significantly to the field with works such as 'Network flows: theory, algorithms, and applications' and 'A faster strongly polynomial minimum cost flow algorithm.' His publications also explore inverse optimization, parametric shortest path algorithms, and applications in graph theory and scheduling. His work emphasizes both theoretical advancements and practical implementations in computational methods.