The Mathematical Programming Language (MPL). - George B. Dantzig; Stanley C. Eisenstat; Thomas L. Magnanti; Steven F. Maier; Michael B. McGrath (ACM Annual Conference, 1971)

Publications. - Thomas L. Magnanti (Math. Program., 1972)

Complementary bases of a matroid. - Thomas L. Magnanti (Discret. Math., 1974)

On the Number of Latent Subsets of Intersecting Collections. - Daniel J. Kleitman; Thomas L. Magnanti (J. Comb. Theory A, 1974)

Fenchel and Lagrange duality are equivalent. - Thomas L. Magnanti (Math. Program., 1974)

Duality and Sensitivity Analysis for Fractional Programs. - Gabriel R. Bitran; Thomas L. Magnanti (Oper. Res., 1976)

Deterministic network optimization: A bibliography. - Bruce L. Golden; Thomas L. Magnanti (Networks, 1977)

Implementing vehicle routing algorithms. - Bruce L. Golden; Thomas L. Magnanti; H. Q. Nguyen (Networks, 1977)

Preface. - Arnoldo C. Hax; Thomas L. Magnanti; Linus Schrage (Oper. Res., 1981)

Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria. - Thomas L. Magnanti; Richard T. Wong (Oper. Res., 1981)

Combinatorial optimization and vehicle fleet planning: Perspectives and prospects. - Thomas L. Magnanti (Networks, 1981)

Editorial. - Thomas L. Magnanti (Oper. Res., 1984)

Network Design and Transportation Planning: Models and Algorithms. - Thomas L. Magnanti; Richard T. Wong (Transp. Sci., 1984)

Generalized Descent Methods for Asymmetric Systems of Equations. - Janice H. Hammond; Thomas L. Magnanti (Math. Oper. Res., 1987)

Parametric linear programming and anti-cycling pivoting rules. - Thomas L. Magnanti; James B. Orlin (Math. Program., 1988)

Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location. - Mordecai Haimovich; Thomas L. Magnanti (SIAM J. Discret. Math., 1988)

A Combined Trip Generation, Trip Distribution, Modal Split, and Trip Assignment Model. - K. Nabil Ali Safwat; Thomas L. Magnanti (Transp. Sci., 1988)

A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design. - Anantaram Balakrishnan; Thomas L. Magnanti; Richard T. Wong (Oper. Res., 1989)

Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets. - Yuping Qiu; Thomas L. Magnanti (Math. Oper. Res., 1989)

Valid inequalities and facets of the capacitated plant location problem. - Janny M. Y. Leung; Thomas L. Magnanti (Math. Program., 1989)

Facets and algorithms for capacitated lot sizing. - Janny M. Y. Leung; Thomas L. Magnanti; Rita Vachani (Math. Program., 1989)

Designing satellite communication networks by zero - one quadratic programming. - Marcia P. Helme; Thomas L. Magnanti (Networks, 1989)

A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs. - Thomas L. Magnanti; Rita Vachani (Oper. Res., 1990)

Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics. - Janny M. Y. Leung; Thomas L. Magnanti; Vijay Singhal (Transp. Sci., 1990)

Models for planning capacity expansion in local access telecommunication networks. - Anantaram Balakrishnan; Thomas L. Magnanti; A. Shulman; Richard T. Wong (Ann. Oper. Res., 1991)

Some Recent Advances in Network Flows. - Ravindra K. Ahuja; Thomas L. Magnanti; James B. Orlin (SIAM Rev., 1991)

A Polyhedral Intersection Theorem for Capacitated Spanning Trees. - Leslie A. Hall; Thomas L. Magnanti (Math. Oper. Res., 1992)

Sensitivity Analysis for Variational Inequalities. - Yuping Qiu; Thomas L. Magnanti (Math. Oper. Res., 1992)

Network flows - theory, algorithms and applications. - Ravindra K. Ahuja; Thomas L. Magnanti; James B. Orlin (Prentice Hall, 1993)

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

Shortest paths, single origin-destination network design, and associated polyhedra. - Thomas L. Magnanti; Prakash Mirchandani (Networks, 1993)

A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning. - Anantaram Balakrishnan; Thomas L. Magnanti; Richard T. Wong (Oper. Res., 1995)

Modeling and Solving the Two-Facility Capacitated Network Loading Problem. - Thomas L. Magnanti; Prakash Mirchandani; Rita Vachani (Oper. Res., 1995)

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

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

Heuristics, LPs, and Trees on Trees: Network Design Analyses. - Anantaram Balakrishnan; Thomas L. Magnanti; Prakash Mirchandani (Oper. Res., 1996)

Averaging Schemes for Variational Inequalities and Systems of Equations. - Thomas L. Magnanti; Georgia Perakis (Math. Oper. Res., 1997)

The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms. - Thomas L. Magnanti; Georgia Perakis (SIAM J. Optim., 1997)

Designing Hierarchical Survivable Networks. - Anantaram Balakrishnan; Thomas L. Magnanti; Prakash Mirchandani (Oper. Res., 1998)

Telecommunication Link Restoration Planning with Multiple Facility Types. - Anantaram Balakrishnan; Thomas L. Magnanti; Joel S. Sokol; Yi Wang (Ann. Oper. Res., 2001)

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

Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type. - Anantaram Balakrishnan; Thomas L. Magnanti; Joel S. Sokol; Yi Wang (Oper. Res., 2002)

Facets and Reformulations for Solving Production Planning With Changeover Costs. - Thomas L. Magnanti; Trilochan Sastry (Oper. Res., 2002)

A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems. - Keely L. Croxton; Bernard Gendron; Thomas L. Magnanti (Manag. Sci., 2003)

Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. - Luis Eduardo Neves Gouveia; Thomas L. Magnanti (Networks, 2003)

Models and Methods for Merge - in - Transit Operations. - Keely L. Croxton; Bernard Gendron; Thomas L. Magnanti (Transp. Sci., 2003)

Separable Concave Optimization Approximately Equals Piecewise Linear Optimization. - Thomas L. Magnanti; Dan Stratila (IPCO, 2004)

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

Connectivity-splitting models for survivable network design. - Anantaram Balakrishnan; Thomas L. Magnanti; Prakash Mirchandani (Networks, 2004)

A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. - Luis Eduardo Neves Gouveia; Thomas L. Magnanti; Cristina Requejo (Networks, 2004)

Strong formulations for network design problems with connectivity requirements. - Thomas L. Magnanti; S. Raghavan 001 (Networks, 2005)

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. - Luis Eduardo Neves Gouveia; Thomas L. Magnanti; Cristina Requejo (Ann. Oper. Res., 2006)

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

Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs. - Keely L. Croxton; Bernard Gendron; Thomas L. Magnanti (Oper. Res., 2007)

Combined route capacity and route length models for unit demand vehicle routing problems. - Maria Teresa Godinho; Luis Eduardo Neves Gouveia; Thomas L. Magnanti (Discret. Optim., 2008)

Maximum Flow Problem. - Ravindra K. Ahuja; Thomas L. Magnanti; James B. Orlin (Encyclopedia of Optimization, 2009)

Minimum Cost Flow Problem. - Ravindra K. Ahuja; Thomas L. Magnanti; James B. Orlin (Encyclopedia of Optimization, 2009)

From Boxes to bees: Active learning in freshmen calculus. - Flora S. Tsai; Karthik Natarajan; Selin Damla Ahipasaoglu; Chau Yuen; Hyowon Lee 001; Ngai-Man Cheung; Justin Ruths; Shisheng Huang; Thomas L. Magnanti (EDUCON, 2013)

Allocating Students to Multidisciplinary Capstone Projects Using Discrete Optimization. - Thomas L. Magnanti; Karthik Natarajan (Interfaces, 2018)

Scheduling with Testing. - Retsef Levi; Thomas L. Magnanti; Yaron Shaposhnik (Manag. Sci., 2019)

Optimization: From Its Inception. - Thomas L. Magnanti (Manag. Sci., 2021)

Scheduling with Testing of Heterogeneous Jobs. - Retsef Levi; Thomas L. Magnanti; Yaron Shaposhnik (Manag. Sci., 2024)