Thomas L. Magnanti

Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin: Maximum Flow Problem. Encyclopedia of Optimization 2009: 2009-2020

Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin: Minimum Cost Flow Problem. Encyclopedia of Optimization 2009: 2095-2108

Maria Teresa Godinho, Luis Gouveia, Thomas L. Magnanti: Combined route capacity and route length models for unit demand vehicle routing problems. Discrete Optimization 5(2): 350-372 (2008)

Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti: Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs. Operations Research 55(1): 146-157 (2007)

Luis Gouveia, Thomas L. Magnanti, Cristina Requejo: An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. Annals OR 146(1): 19-39 (2006)

Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, David Simchi-Levi, Chung-Piaw Teo: Inventory placement in acyclic supply chain networks. Oper. Res. Lett. 34(2): 228-238 (2006)

Thomas L. Magnanti, S. Raghavan: Strong formulations for network design problems with connectivity requirements. Networks 45(2): 61-79 (2005)

Thomas L. Magnanti, Georgia Perakis: Solving variational inequality and fixed point problems by line searches and potential optimization. Math. Program. 101(3): 435-461 (2004)

Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani: Connectivity-splitting models for survivable network design. Networks 43(1): 10-27 (2004)

Luis Gouveia, Thomas L. Magnanti, Cristina Requejo: A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. Networks 44(4): 254-265 (2004)

Thomas L. Magnanti, Dan Stratila: Separable Concave Optimization Approximately Equals Piecewise Linear Optimization. IPCO 2004: 234-243

Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti: A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems. Management Science 49(9): 1268-1273 (2003)

Luis Gouveia, Thomas L. Magnanti: Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Networks 41(3): 159-173 (2003)

Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti: Models and Methods for Merge - in - Transit Operations. Transportation Science 37(1): 1-22 (2003)

Anantaram Balakrishnan, Thomas L. Magnanti, Joel S. Sokol, Yi Wang: Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type. Operations Research 50(4): 617-635 (2002)

Thomas L. Magnanti, Trilochan Sastry: Facets and Reformulations for Solving Production Planning With Changeover Costs. Operations Research 50(4): 708-719 (2002)

Anantaram Balakrishnan, Thomas L. Magnanti, Joel S. Sokol, Yi Wang: Telecommunication Link Restoration Planning with Multiple Facility Types. Annals OR 106(1-4): 127-154 (2001)

Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani: Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems. Oper. Res. Lett. 29(3): 99-106 (2001)

El Houssaine Aghezzaf, Thomas L. Magnanti, Laurence A. Wolsey: Optimizing constrained subtrees of trees. Math. Program. 71: 113-126 (1995)

Thomas L. Magnanti, Georgia Perakis: A unifying geometric solution framework and complexity analysis for variational inequalities. Math. Program. 71: 327-351 (1995)

Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin: Network flows - theory, algorithms and applications. Prentice Hall 1993, isbn 978-0-13-617549-0, pp. I-XV, 1-846

Thomas L. Magnanti, Prakash Mirchandani, Rita Vachani: The convex hull of two core capacitated network design problems. Math. Program. 60: 233-250 (1993)

Thomas L. Magnanti, Prakash Mirchandani: Shortest paths, single origin-destination network design, and associated polyhedra. Networks 23(2): 103-121 (1993)

Marcia P. Helme, Thomas L. Magnanti: Designing satellite communication networks by zero - one quadratic programming. Networks 19(4): 427-450 (1989)

M. Haimovich, Thomas L. Magnanti: Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location. SIAM J. Discrete Math. 1(1): 50-64 (1988)