HOME | FACULTY AND RESEARCH | FACULTY DIRECTORY

Faculty & Research

Thomas Magnanti

  • Institute Professor
  • Professor of Operations Research

Thomas Magnanti is an Institute Professor and a Professor of Operations Research at the MIT Sloan School of Management.

Magnanti is an excellent source on teaching and researching the theory and application of large-scale optimization systems, including communications systems, production planning and scheduling, transportation planning, facility location, logistics, and network design. He is the co-author of two textbooks, Applied Mathematical Programming (Addison-Wesley, 1977) and Network Flows: Theory, Algorithms, and Applications (Prentice Hall, 1993).

Magnanti holds a BS in chemical engineering from Syracuse University as well as an MS in statistics, an MS in mathematics, and a PhD in operations research from Stanford University.

  • "Maintenance Scheduling for Modular Systems – New Models and Algorithms." Levi, Retsef, Thomas Magnanti, Jack Muckstadt, Danny Segev and Eric Zarybnisky. Naval Research Logistics Vol. 61, No. 6 (2014): 472-488.
  • "Scheduling and Testing." Retsef Levi, Thomas Magnanti and Yaron Shaposhnik. In Proceedings of the MSOM Conference 2014, Seattle, WA: June 2014.
  • "Cycle Limited Maintenance Scheduling with Submodular Costs." Retsef Levi, Thomas Magnanti, Jack Muckstadt, Danny Segev and Eric Zarybnisky. In Proceedings of MSOM Conference 2011, Ann Arbor, MI: June 2011.
  • "Maintenance Scheduling for Modular Systems – New Models and Algorithms." Retsef Levi, Thomas Magnanti and Eric Zarybnisky. In Proceedings of MSOM Conference 2010, June 2010.
  • "Computing Fixed Points by Averaging." Magnanti, Thomas and Georgia Perakis. In Transportation and Network Analysis– Current Trends, 181-198. New York, NY: Springer US, 2002.
  • "From Frank-Wolfe to Steepest Descent; A Descent Framework for Solving Asymmetric Variational Inequalities." Thomas Magnanti and Georgia Perakis. In Proceedings of the 1999 NSF Design and Manufacturing Grantees Conference, Long Beach, CA: January 1999.
  • "Averaging with Well-behaved Maps for Finding Fixed Points." Marina Epelman, Thomas Magnanti and Georgia Perakis. In Proceedings of the 1998 NSF Design and Manufacturing Grantees Conference, Monterrey, Mexico: January 1998.
  • "Averaging Schemes for Variational Inequalities and Systems of Equations." Magnanti, Thomas and Geogia Perakis. Mathematics of Operations Research Vol. 22, No. 3 (1997): 568-587.
  • "The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms." Magnanti, Thomas and Georgia Perakis. SIAM Journal on Optimization Vol. 7, No. 1 (1997): 248-273.
  • "A Unifying Geometric Solution Framework and Complexity Analysis for Variational Inequalities." Magnanti, Thomas and Georgia Perakis. Mathematical Programming Vol. 71, No. 3 (1995): 327-352.
  • "Solving Fixed Point and Variational Inequality Problems: Complexity, Convergence Conditions, and Averaging Methods." Thomas Magnanti and Georgia Perakis. In Proceedings of the 1995 NSF Design and Manufacturing Grantees Conference, La Jolla, CA: January 1995.
  • Network Flows: Theory, Algorithms, and Applications. Ahuja, Ravindra K., Thomas Magnanti and James B. Orlin. Englewood Cliffs, N.J.: Prentice Hall, 1993.
  • Applied Mathematical Programming. Bradley, Stephen P., Arnoldo Hax and Thomas Magnanti. Reading, MA: Addison-Wesley Pub. Co., 1977.