Thomas L. Magnanti

According to our database1, Thomas L. Magnanti authored at least 59 papers between 1972 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Scheduling with Testing.
Manag. Sci., 2019

2018
Allocating Students to Multidisciplinary Capstone Projects Using Discrete Optimization.
Interfaces, 2018

2013
From Boxes to bees: Active learning in freshmen calculus.
Proceedings of the IEEE Global Engineering Education Conference, 2013

2009
Minimum Cost Flow Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Maximum Flow Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2008
Combined route capacity and route length models for unit demand vehicle routing problems.
Discret. Optim., 2008

2007
Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs.
Oper. Res., 2007

2006
Inventory placement in acyclic supply chain networks.
Oper. Res. Lett., 2006

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees.
Ann. Oper. Res., 2006

2005
Strong formulations for network design problems with connectivity requirements.
Networks, 2005

2004
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees.
Networks, 2004

Connectivity-splitting models for survivable network design.
Networks, 2004

Solving variational inequality and fixed point problems by line searches and potential optimization.
Math. Program., 2004

Separable Concave Optimization Approximately Equals Piecewise Linear Optimization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003
Models and Methods for Merge - in - Transit Operations.
Transp. Sci., 2003

Network flow models for designing diameter-constrained minimum-spanning and Steiner trees.
Networks, 2003

A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems.
Manag. Sci., 2003

2002
Facets and Reformulations for Solving Production Planning With Changeover Costs.
Oper. Res., 2002

Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type.
Oper. Res., 2002

2001
Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems.
Oper. Res. Lett., 2001

Telecommunication Link Restoration Planning with Multiple Facility Types.
Ann. Oper. Res., 2001

1998
Designing Hierarchical Survivable Networks.
Oper. Res., 1998

1997
The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms.
SIAM J. Optim., 1997

Averaging Schemes for Variational Inequalities and Systems of Equations.
Math. Oper. Res., 1997

1996
Heuristics, LPs, and Trees on Trees: Network Design Analyses.
Oper. Res., 1996

1995
A unifying geometric solution framework and complexity analysis for variational inequalities.
Math. Program., 1995

Optimizing constrained subtrees of trees.
Math. Program., 1995

Modeling and Solving the Two-Facility Capacitated Network Loading Problem.
Oper. Res., 1995

A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning.
Oper. Res., 1995

1993
Shortest paths, single origin-destination network design, and associated polyhedra.
Networks, 1993

The convex hull of two core capacitated network design problems.
Math. Program., 1993

Network flows - theory, algorithms and applications.
Prentice Hall, ISBN: 978-0-13-617549-0, 1993

1992
Sensitivity Analysis for Variational Inequalities.
Math. Oper. Res., 1992

A Polyhedral Intersection Theorem for Capacitated Spanning Trees.
Math. Oper. Res., 1992

1991
Some Recent Advances in Network Flows.
SIAM Rev., 1991

Models for planning capacity expansion in local access telecommunication networks.
Ann. Oper. Res., 1991

1990
Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics.
Transp. Sci., 1990

A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs.
Oper. Res., 1990

1989
Designing satellite communication networks by zero - one quadratic programming.
Networks, 1989

Facets and algorithms for capacitated lot sizing.
Math. Program., 1989

Valid inequalities and facets of the capacitated plant location problem.
Math. Program., 1989

Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets.
Math. Oper. Res., 1989

A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design.
Oper. Res., 1989

1988
A Combined Trip Generation, Trip Distribution, Modal Split, and Trip Assignment Model.
Transp. Sci., 1988

Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location.
SIAM J. Discret. Math., 1988

Parametric linear programming and anti-cycling pivoting rules.
Math. Program., 1988

1987
Generalized Descent Methods for Asymmetric Systems of Equations.
Math. Oper. Res., 1987

Editorial.
Oper. Res., 1987

1984
Network Design and Transportation Planning: Models and Algorithms.
Transp. Sci., 1984

1981
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects.
Networks, 1981

Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria.
Oper. Res., 1981

Preface.
Oper. Res., 1981

1977
Implementing vehicle routing algorithms.
Networks, 1977

Deterministic network optimization: A bibliography.
Networks, 1977

1976
Duality and Sensitivity Analysis for Fractional Programs.
Oper. Res., 1976

1974
Fenchel and Lagrange duality are equivalent.
Math. Program., 1974

On the Number of Latent Subsets of Intersecting Collections.
J. Comb. Theory, Ser. A, 1974

Complementary bases of a matroid.
Discret. Math., 1974

1972
Publications.
Math. Program., 1972


  Loading...