Thomas L. Magnanti
According to our database^{1},
Thomas L. Magnanti
authored at least 59 papers
between 1972 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org

on id.loc.gov

on dnb.info
On csauthors.net:
Bibliography
2019
Manag. Sci., 2019
2018
Allocating Students to Multidisciplinary Capstone Projects Using Discrete Optimization.
Interfaces, 2018
2013
Proceedings of the IEEE Global Engineering Education Conference, 2013
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
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
Oper. Res., 2007
2006
Oper. Res. Lett., 2006
An intersecting tree model for odddiameterconstrained minimum spanning and Steiner trees.
Ann. Oper. Res., 2006
2005
Networks, 2005
2004
A 2path approach for odddiameterconstrained minimum spanning and Steiner trees.
Networks, 2004
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
Transp. Sci., 2003
Network flow models for designing diameterconstrained minimumspanning and Steiner trees.
Networks, 2003
A Comparison of Mixed  Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems.
Manag. Sci., 2003
2002
Oper. Res., 2002
Oper. Res., 2002
2001
Intuitive solutiondoubling techniques for worstcase analysis of some survivable network design problems.
Oper. Res. Lett., 2001
Ann. Oper. Res., 2001
1998
Oper. Res., 1998
1997
The Orthogonality Theorem and the StrongfMonotonicity Condition for Variational Inequality Algorithms.
SIAM J. Optim., 1997
Math. Oper. Res., 1997
1996
Oper. Res., 1996
1995
A unifying geometric solution framework and complexity analysis for variational inequalities.
Math. Program., 1995
Math. Program., 1995
Oper. Res., 1995
A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning.
Oper. Res., 1995
1993
Shortest paths, single origindestination network design, and associated polyhedra.
Networks, 1993
Math. Program., 1993
Network flows  theory, algorithms and applications.
Prentice Hall, ISBN: 9780136175490, 1993
1992
Math. Oper. Res., 1992
Math. Oper. Res., 1992
1991
SIAM Rev., 1991
Models for planning capacity expansion in local access telecommunication networks.
Ann. Oper. Res., 1991
1990
Transp. Sci., 1990
Oper. Res., 1990
1989
Networks, 1989
Math. Program., 1989
Math. Program., 1989
Math. Oper. Res., 1989
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
Math. Program., 1988
1987
Math. Oper. Res., 1987
Oper. Res., 1987
1984
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
Oper. Res., 1981
1977
Networks, 1977
Networks, 1977
1976
Oper. Res., 1976
1974
Math. Program., 1974
J. Comb. Theory, Ser. A, 1974
Discret. Math., 1974
1972
Math. Program., 1972