2002 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)
2000 - Fellow of the American Academy of Arts and Sciences
1991 - Member of the National Academy of Engineering For leadership in operations, research including fundamental contributions to optimal design of communication and transportation networks, and in education in manufacturing.
His primary scientific interests are in Mathematical optimization, Flow network, Network planning and design, Integer programming and Algorithm. His Mathematical optimization research integrates issues from Differentiable function and Nonlinear programming. His work on Circulation problem as part of general Flow network research is frequently linked to Urban transportation and Multiple modes, thereby connecting diverse disciplines of science.
His Circulation problem research focuses on Data structure and how it relates to Shortest path problem. His studies deal with areas such as Transportation planning, Computer programming, SIGNAL and Highway engineering as well as Network planning and design. The Integer programming study combines topics in areas such as Linear programming, Lagrangian relaxation, Decomposition and Integer.
Thomas L. Magnanti mainly focuses on Mathematical optimization, Network planning and design, Linear programming, Flow network and Algorithm. His Network planning and design research incorporates themes from Installation, Enhanced Data Rates for GSM Evolution, Steiner tree problem and Spanning tree. His research in Linear programming intersects with topics in Minification, Quadratic programming, Telecommunications network, Lagrangian relaxation and Optimization problem.
His Flow network study which covers Shortest path problem that intersects with Data structure. His work deals with themes such as Submodular set function, Modular design and Systems modeling, which intersect with Algorithm. Many of his studies on Multi-commodity flow problem involve topics that are commonly interrelated, such as Minimum-cost flow problem.
Operations research, Mathematical optimization, Scheduling, Approximation algorithm and Scheduling are his primary areas of study. His research investigates the connection between Mathematical optimization and topics such as Computation that intersect with issues in Integer programming, Linear programming and Gradient method. His research integrates issues of Dynamic programming, Heuristics and Maintenance actions in his study of Scheduling.
The study incorporates disciplines such as Piecewise linear function, Polynomial, Feasible region and Heuristic in addition to Approximation algorithm. He has researched Scheduling in several fields, including Submodular set function, Modular design and Systems modeling. Thomas L. Magnanti conducts interdisciplinary study in the fields of Algorithm and Primal dual through his works.
The scientist’s investigation covers issues in Preventive maintenance, Planned maintenance, Systems modeling, Approximation algorithm and Aircraft maintenance. Among his Preventive maintenance studies, you can observe a synthesis of other disciplines of science such as Submodular set function, Modular design, Algorithm and Scheduling.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Network Flows
R. K. Ahuja;T. L. Magnanti;J. B. Orlin.
(2011)
Network Flows: Theory, Algorithms, and Applications
Ravindra K. Ahuja;Thomas L. Magnanti;James B. Orlin.
(1993)
Network Design and Transportation Planning: Models and Algorithms
Thomas L. Magnanti;Richard T. Wong.
Transportation Science (1984)
Applied Mathematical Programming
Stephen P. Bradley;Arnoldo C. Hax;Thomas L. Magnanti.
(1977)
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
Thomas L. Magnanti;Richard T. Wong.
Operations Research (1981)
Implementing vehicle routing algorithms
Bruce L Golden;Thomas L Magnanti;Hien Q Nguyen.
Networks (1977)
A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
A. Balakrishnan;T. L. Magnanti;R. T. Wong.
Operations Research (1989)
Equilibria on a Congested Transportation Network
H. Z. Aashtiani;T. L. Magnanti.
Siam Journal on Algebraic and Discrete Methods (1981)
Modeling and Solving the Two-Facility Capacitated Network Loading Problem
Thomas L. Magnanti;Prakash Mirchandani;Rita Vachani.
Operations Research (1995)
A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
Keely L. Croxton;Bernard Gendron;Thomas L. Magnanti.
Management Science (2003)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
MIT
University of Florida
University of Montreal
University of Maryland, College Park
Université Catholique de Louvain
National University of Singapore
Technical University of Denmark
Lund University
Northeastern University
Duke University
University of Macedonia
St. John's University
KU Leuven
York University
Grain Research Centre
National Taiwan Ocean University
University of Arizona
University of Massachusetts Medical School
Teikyo University
Durham University
Langley Research Center
University of Melbourne
University of North Dakota
University of Zurich
Colorado State University