ISyE Seminar Series: James Orlin

"The Shortest Cycle Problem and the Second Shortest Path Problem"

Presentation by Professor James Orlin
Operations Research
MIT Sloan School
 

Wednesday, October 25
3:15pm - Refreshments, Lind Hall 305
3:30pm - Graduate Seminar, Lind Hall 305

 

About:

Professor Orlin will present an algorithm for finding the fastest algorithm for finding a shortest cycle in a directed graph. The new algorithm is actually simpler than previous fast algorithms for the shortest cycle problem. He will also address the following question: which is intrinsically an easier problem: the problem of finding the shortest cycle in a graph or the problem of finding the second shortest path from a given origin to a given destination. Professor Orlin will also present results that show that one of these two problems is a special case of the other, and is likely to be intrinsically easier than the other. 

 

Bio:

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 2004 EXPLOR Award for leadership in online marketing research, 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 2008 INFORMS Koopman Prize for research in military operations research, the 2011 IEEE Bennett Prize for research in communication theory, and 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.”

 

Seminar Video:

Category
Seminars
Start date
Friday, Oct. 25, 2019, 3:15 p.m.
Location

Lind Hall
Room 305