ISyE Graduate Seminar: The Shortest Cycle Problem and the Second Shortest Path Problem
Please join us for our next seminar of fall semester. This special seminar will feature Professor James Orlin of the Massachusetts Institute of Technology who will discuss the fastest algorithm for finding the shortest cycle in a directed graph.
Livestreaming: Again this year we are coordinating with the Institute for Mathematics and its Applications to livestream our seminars on the IMA YouTube Channel. Attend in person or watch the livestream.
“The Shortest Cycle Problem and the Second Shortest Path Problem”
Friday, Oct. 25, 2019 (Note Friday date)
3:15 p.m. - Refreshments
3:30 p.m. - Graduate Seminar
Professor James Orlin
Sloan School of Management
Massachusetts Institute of Technology
About the seminar
Professor Orlin will present the fastest algorithm for finding the 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, finding the shortest cycle in a graph or finding the second shortest path from a given origin to a given destination? 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.
About the speaker
James Orlin is the E. Pennell Brooks Professor of Operations Research (OR) at the Massachusetts Institute of Technology’s Sloan School of Management. 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 OR, the 2004 EXPLOR Award for leadership in online marketing research, the 2007 INFORMS Computing Society Prize for research in the interface of OR 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.”