Thomas L. Magnanti
#11,829
Most Influential Person Now
American engineer
Thomas L. Magnanti's AcademicInfluence.com Rankings
Thomas L. Magnantiengineering Degrees
Engineering
#606
World Rank
#995
Historical Rank
#266
USA Rank
Industrial Engineering
#28
World Rank
#30
Historical Rank
#6
USA Rank
Applied Physics
#1553
World Rank
#1585
Historical Rank
#169
USA Rank
Download Badge
Engineering
Thomas L. Magnanti's Degrees
- PhD Operations Research Stanford University
- Masters Operations Research Stanford University
- Bachelors Industrial Engineering Cornell University
Why Is Thomas L. Magnanti Influential?
(Suggest an Edit or Addition)According to Wikipedia, Thomas Lee Magnanti is an American engineer and Institute Professor and former Dean of the School of Engineering at the Massachusetts Institute of Technology. Magnanti served as the founding president of the Singapore University of Technology and Design from 2009 to 2017.
Thomas L. Magnanti's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Network flows - theory, algorithms and applications (1993) (7664)
- Network Design and Transportation Planning: Models and Algorithms (1984) (1301)
- Network Flows (2011) (1116)
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria (1981) (674)
- Applied Mathematical Programming (1977) (674)
- Implementing vehicle routing algorithms (1977) (340)
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design (1989) (294)
- Equilibria on a Congested Transportation Network (1981) (267)
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem (1995) (257)
- A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems (2003) (197)
- The convex hull of two core capacitated network design problems (1993) (193)
- Combinatorial optimization and vehicle fleet planning: Perspectives and prospects (1981) (185)
- Tailoring Benders decomposition for uncapacitated network design (1986) (140)
- A Combined Trip Generation, Trip Distribution, Modal Split, and Trip Assignment Model (1988) (135)
- Models for planning capacity expansion in local access telecommunication networks (2015) (132)
- Sensitivity Analysis for Variational Inequalities (1992) (132)
- The structure of admissible points with respect to cone dominance (1979) (126)
- Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets (1989) (123)
- Shortest paths, single origin-destination network design, and associated polyhedra (1993) (112)
- Facets and algorithms for capacitated lot sizing (1989) (111)
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees (2003) (110)
- Valid inequalities and facets of the capacitated plant location problem (1989) (104)
- Routing and scheduling on a shoreline with release times (1990) (103)
- Models and Methods for Merge - in - Transit Operations (2003) (103)
- Deterministic network optimization: A bibliography (1977) (102)
- Strong formulations for network design problems with connectivity requirements (2005) (98)
- A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning (1995) (95)
- Modeling and heuristic worst-case performance analysis of the two-level network design problem (1994) (91)
- Inventory placement in acyclic supply chain networks (2006) (89)
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs (2007) (86)
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs (1990) (83)
- A Dual-Based Algorithm for Multi-Level Network Design (1994) (81)
- Generalized Linear Programming Solves the Dual (1976) (81)
- Chapter 9 Optimal trees (1995) (78)
- Approximation Methods for the Uncapacitated Dynamic Lot Size Problem (1984) (75)
- Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics (1990) (71)
- Capacitated trees, capacitated routing, and associated polyhedra (1990) (63)
- MODELS AND ALGORITHMS FOR PREDICTING URBAN TRAFFIC EQUILIBRIA (1984) (62)
- Designing Hierarchical Survivable Networks (1998) (58)
- Some Recent Advances in Network Flows (1991) (53)
- Designing satellite communication networks by zero - one quadratic programming (1989) (46)
- Duality and Sensitivity Analysis for Fractional Programs (1976) (45)
- Decomposition methods for facility location problems (1986) (41)
- NETWORK DESIGN AND TRANSPORTATION PLANNING (1990) (40)
- Chapter IV Network flows (1989) (39)
- Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type (2002) (37)
- Some Abstract Pivot Algorithms (1975) (36)
- Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location (1988) (35)
- Parametric linear programming and anti-cycling pivoting rules (1988) (34)
- On the Number of Latent Subsets of Intersecting Collections (1974) (34)
- Telecommunication Link Restoration Planning with Multiple Facility Types (2001) (33)
- Chapter 1 Applications of network optimization (1995) (33)
- A unifying geometric solution framework and complexity analysis for variational inequalities (1995) (32)
- Fenchel and Lagrange duality are equivalent (1974) (32)
- A 2‐path approach for odd‐diameter‐constrained minimum spanning and Steiner trees (2004) (31)
- Combined route capacity and route length models for unit demand vehicle routing problems (2008) (31)
- Connectivity–splitting models for survivable network design (2004) (31)
- Beyond normality: A cross moment-stochastic user equilibrium model (2015) (29)
- Averaging Schemes for Variational Inequalities and Systems of Equations (1997) (28)
- Modeling and Solving the Capacitated Network Loading Problem (1991) (28)
- Separable Concave Optimization Approximately Equals Piecewise Linear Optimization (2004) (27)
- A linearization and decomposition algorithm for computing urban traffic equilibria (1983) (23)
- Scheduling with Testing (2019) (23)
- Generalized Descent Methods for Asymmetric Systems of Equations (1985) (23)
- Polyhedral properties of the network restoration problem-with the convex hull of a special case (1997) (22)
- A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees (2004) (20)
- Optimizing constrained subtrees of trees (1995) (19)
- Implementing primal-dual network flow algorithms (1976) (19)
- ROUTING IN POINT-TO-POINT DELIVERY SYSTEMS (1988) (18)
- Heuristics, LPs, and Trees on Trees: Network Design Analyses (1996) (17)
- TRANSPORTATION PLANNING: NETWORK MODELS AND THEIR IMPLEMENTATION (1978) (17)
- Maintenance scheduling for modular systems: Modeling and algorithms (2014) (17)
- A Polyhedral Intersection Theorem for Capacitated Spanning Trees (1992) (16)
- TRANSPORTATION NETWORK ANALYSIS AND DECOMPOSITION METHODS (1978) (15)
- Solving variational inequality and fixed point problems by line searches and potential optimization (2004) (12)
- Maximum Flow Problem (2009) (12)
- On the Convergence of Classical Variational Inequality Algorithms (1993) (11)
- Allocating Students to Multidisciplinary Capstone Projects Using Discrete Optimization (2018) (10)
- An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees (2006) (10)
- The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms (1997) (10)
- Facets and Reformulations for Solving Production Planning With Changeover Costs (2002) (9)
- On a Time-Dependent Model for the Unit Demand Vehicle Routing Problem (2007) (9)
- A Decomposition Algorithm for Expanding Local Access Telecommunications Networks t (9)
- From Boxes to bees: Active learning in freshmen calculus (2013) (8)
- Convergence Conditions for Variational Inequality Algorithms (1993) (8)
- The multi-level network design problem (1991) (7)
- Shortest Paths, Network Design and Associated Polyhedra (1990) (7)
- Maintenance and flight scheduling of low observable aircraft (2015) (7)
- MPL, Mathematical Programming Language: specification manual for Committee review (1970) (6)
- A Linear Approximation Approach to Duality in Nonlinear Programming (1973) (6)
- Linear programming and capacitated network loading (1998) (6)
- Solving variational inequality and fixed point problems by averaging and optimizing potentials (1997) (6)
- Computing Fixed Points by Averaging (2002) (5)
- Complementary bases of a matroid (1974) (5)
- On the unit demand vehicle routing problem: flow based inequalities implied by a time dependent formulation (2009) (5)
- Minimum Cost Flow Problem (2009) (5)
- A contracting ellipsoid method for variational inequality problems (1987) (4)
- Duality Based Characterizations of Efficient Facets (1980) (4)
- The Service-Time Restricted Capacitated Arc Routing Problem (2011) (4)
- Non-linear programming and the maximum principle for discrete time optimal control problems (1975) (4)
- Analysis of the Uncapacitated Dynamic Lot Size Problem (1982) (3)
- Location Games and Bounds for Median Problems (1985) (3)
- Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems (2012) (2)
- The Mathematical Programming Language (MPL) (1971) (2)
- Heuristics, LPs, and Generalizations of Trees on Trees (1993) (1)
- Networks as an aid in transportation and contingency planning (1983) (1)
- Working Paper MASSA CHUSETTS INSTI TUTE OF TECHNOLOGY Modeling and Solving the Single Facility Line Restoration Problem (1)
- Averaging Schemes for Solving Fived Point and Variational Inequality Problems (1994) (1)
- Doubling or Splitting: Strategies for Modeling and Analyzing Survivable Network Design Problems (1994) (1)
- Pup Matching: Model Formulations and Solution Approaches (2002) (1)
- Network Design with Routing Requirements (2021) (1)
- Finding fixed points by averaging with well-behaved maps (1997) (1)
- NONLINEAR PROGRAMMING AND THE MAXIMUM PRINCIPLE FOR DISCRETE TIME OPTIMAL CONTROL PROBLEMS (1)
- An Adaptive SPT Rule for Scheduling and Testing Heterogeneous Jobs (2019) (1)
- Beyond Normality: A Distributionally Robust Stochastic User Equilibrium Model (2014) (1)
- Mssachuse-fts. I Nstiute (0)
- Editorial (1984) (0)
- Other Matroids on Graphs and Signed , Gain , and Biased Graphs Selections from A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas Preliminary (2008) (0)
- Duality and Sensitivity Analysis for Fractional Programs (REVISED) (1975) (0)
- FACETS A ND A LGORITHMS F OR C APACITATED (1989) (0)
- Some Abstract Pivot Algorithms (REVISED) (1974) (0)
- Building a New Academic Institution (2018) (0)
- Right questions, right people, right actions (1991) (0)
- Improved Formulations for Survivable Network Design (2001) (0)
- An Optimization Framework for Air Force Logistics Models (2014) (0)
- The Multi-Network Design Problem (1991) (0)
- Location of Facilities on a Stochastic Network Location of Facilities on a Stochastic Network (0)
- Optimization: From Its Inception (2021) (0)
- Preface (1981) (0)
- Editorial (1987) (0)
- Separable Concave Optimization Approximately Equals (2006) (0)
- Learning from the Master: Saul Gass, Linear Programming, and the OR Profession (2006) (0)
- Valid inequalities and facets of the multi product capacitated lot-sizing problem with changeover costs (1992) (0)
- Editorial (1986) (0)
- Call for nominations for the George B. Dantzig Prize 1991 (1990) (0)
- On the Single Commodity Flow Formulation: Generalizing the Upper and Lower Flow Bounding Inequalities (2014) (0)
This paper list is powered by the following services:
Other Resources About Thomas L. Magnanti
What Schools Are Affiliated With Thomas L. Magnanti?
Thomas L. Magnanti is affiliated with the following schools:
