Thomas L. Magnanti

Publication Activity (10 Years)

Years Active: 1971-2024
Publications (10 Years): 4

Top Topics

Discrete Optimization

Top Venues

Publications

Retsef Levi, Thomas L. Magnanti, Yaron Shaposhnik
Scheduling with Testing of Heterogeneous Jobs. Manag. Sci. 70 (5) (2024)
Thomas L. Magnanti
Optimization: From Its Inception. Manag. Sci. 67 (9) (2021)
Retsef Levi, Thomas L. Magnanti, Yaron Shaposhnik
Scheduling with Testing. Manag. Sci. 65 (2) (2019)
Thomas L. Magnanti, Karthik Natarajan
Allocating Students to Multidisciplinary Capstone Projects Using Discrete Optimization. Interfaces 48 (3) (2018)
Flora S. Tsai, Karthik Natarajan, Selin Damla Ahipasaoglu, Chau Yuen, Hyowon Lee, Ngai-Man Cheung, Justin Ruths, Shisheng Huang, Thomas L. Magnanti
From Boxes to bees: Active learning in freshmen calculus. EDUCON (2013)
Maria Teresa Godinho, Luis Eduardo Neves Gouveia, Thomas L. Magnanti
Combined route capacity and route length models for unit demand vehicle routing problems. Discret. Optim. 5 (2) (2008)
Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti
Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs. Oper. Res. 55 (1) (2007)
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) (2006)
Luis Eduardo Neves Gouveia, Thomas L. Magnanti, Cristina Requejo
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. Ann. Oper. Res. 146 (1) (2006)
Thomas L. Magnanti, S. Raghavan
Strong formulations for network design problems with connectivity requirements. Networks 45 (2) (2005)
Luis Eduardo Neves Gouveia, Thomas L. Magnanti, Cristina Requejo
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. Networks 44 (4) (2004)
Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani
Connectivity-splitting models for survivable network design. Networks 43 (1) (2004)
Thomas L. Magnanti, Georgia Perakis
Solving variational inequality and fixed point problems by line searches and potential optimization. Math. Program. 101 (3) (2004)
Thomas L. Magnanti, Dan Stratila
Separable Concave Optimization Approximately Equals Piecewise Linear Optimization. IPCO (2004)
Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti
Models and Methods for Merge - in - Transit Operations. Transp. Sci. 37 (1) (2003)
Luis Eduardo Neves Gouveia, Thomas L. Magnanti
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Networks 41 (3) (2003)
Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti
A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems. Manag. Sci. 49 (9) (2003)
Anantaram Balakrishnan, Thomas L. Magnanti, Joel S. Sokol, Yi Wang
Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type. Oper. Res. 50 (4) (2002)
Thomas L. Magnanti, Trilochan Sastry
Facets and Reformulations for Solving Production Planning With Changeover Costs. Oper. Res. 50 (4) (2002)
Anantaram Balakrishnan, Thomas L. Magnanti, Joel S. Sokol, Yi Wang
Telecommunication Link Restoration Planning with Multiple Facility Types. Ann. Oper. Res. 106 (1-4) (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) (2001)
Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani
Designing Hierarchical Survivable Networks. Oper. Res. 46 (1) (1998)
Thomas L. Magnanti, Georgia Perakis
Averaging Schemes for Variational Inequalities and Systems of Equations. Math. Oper. Res. 22 (3) (1997)
Thomas L. Magnanti, Georgia Perakis
The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms. SIAM J. Optim. 7 (1) (1997)
Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani
Heuristics, LPs, and Trees on Trees: Network Design Analyses. Oper. Res. 44 (3) (1996)
Thomas L. Magnanti, Prakash Mirchandani, Rita Vachani
Modeling and Solving the Two-Facility Capacitated Network Loading Problem. Oper. Res. 43 (1) (1995)
Thomas L. Magnanti, Georgia Perakis
A unifying geometric solution framework and complexity analysis for variational inequalities. Math. Program. 71 (1995)
El Houssaine Aghezzaf, Thomas L. Magnanti, Laurence A. Wolsey
Optimizing constrained subtrees of trees. Math. Program. 71 (1995)
Anantaram Balakrishnan, Thomas L. Magnanti, Richard T. Wong
A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning. Oper. Res. 43 (1) (1995)
Thomas L. Magnanti, Prakash Mirchandani
Shortest paths, single origin-destination network design, and associated polyhedra. Networks 23 (2) (1993)
Thomas L. Magnanti, Prakash Mirchandani, Rita Vachani
The convex hull of two core capacitated network design problems. Math. Program. 60 (1993)
Leslie A. Hall, Thomas L. Magnanti
A Polyhedral Intersection Theorem for Capacitated Spanning Trees. Math. Oper. Res. 17 (2) (1992)
Yuping Qiu, Thomas L. Magnanti
Sensitivity Analysis for Variational Inequalities. Math. Oper. Res. 17 (1) (1992)
Anantaram Balakrishnan, Thomas L. Magnanti, A. Shulman, Richard T. Wong
Models for planning capacity expansion in local access telecommunication networks. Ann. Oper. Res. 33 (4) (1991)
Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
Some Recent Advances in Network Flows. SIAM Rev. 33 (2) (1991)
Janny M. Y. Leung, Thomas L. Magnanti, Vijay Singhal
Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics. Transp. Sci. 24 (4) (1990)
Thomas L. Magnanti, Rita Vachani
A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs. Oper. Res. 38 (3) (1990)
Marcia P. Helme, Thomas L. Magnanti
Designing satellite communication networks by zero - one quadratic programming. Networks 19 (4) (1989)
Janny M. Y. Leung, Thomas L. Magnanti, Rita Vachani
Facets and algorithms for capacitated lot sizing. Math. Program. 45 (1-3) (1989)
Anantaram Balakrishnan, Thomas L. Magnanti, Richard T. Wong
A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design. Oper. Res. 37 (5) (1989)
Yuping Qiu, Thomas L. Magnanti
Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets. Math. Oper. Res. 14 (3) (1989)
Janny M. Y. Leung, Thomas L. Magnanti
Valid inequalities and facets of the capacitated plant location problem. Math. Program. 44 (1-3) (1989)
Mordecai Haimovich, Thomas L. Magnanti
Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location. SIAM J. Discret. Math. 1 (1) (1988)
K. Nabil Ali Safwat, Thomas L. Magnanti
A Combined Trip Generation, Trip Distribution, Modal Split, and Trip Assignment Model. Transp. Sci. 22 (1) (1988)
Thomas L. Magnanti, James B. Orlin
Parametric linear programming and anti-cycling pivoting rules. Math. Program. 41 (1-3) (1988)
Janice H. Hammond, Thomas L. Magnanti
Generalized Descent Methods for Asymmetric Systems of Equations. Math. Oper. Res. 12 (4) (1987)
Thomas L. Magnanti
Editorial. Oper. Res. 35 (1) (1987)
Thomas L. Magnanti
Editorial. Oper. Res. 34 (1) (1986)
Thomas L. Magnanti, Richard T. Wong
Network Design and Transportation Planning: Models and Algorithms. Transp. Sci. 18 (1) (1984)
Thomas L. Magnanti
Editorial. Oper. Res. 32 (1) (1984)
Thomas L. Magnanti
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects. Networks 11 (2) (1981)
Arnoldo C. Hax, Thomas L. Magnanti, Linus Schrage
Preface. Oper. Res. 29 (4) (1981)
Thomas L. Magnanti, Richard T. Wong
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria. Oper. Res. 29 (3) (1981)
Bruce L. Golden, Thomas L. Magnanti, H. Q. Nguyen
Implementing vehicle routing algorithms. Networks 7 (2) (1977)
Bruce L. Golden, Thomas L. Magnanti
Deterministic network optimization: A bibliography. Networks 7 (2) (1977)
Gabriel R. Bitran, Thomas L. Magnanti
Duality and Sensitivity Analysis for Fractional Programs. Oper. Res. 24 (4) (1976)
Thomas L. Magnanti
Complementary bases of a matroid. Discret. Math. 8 (4) (1974)
Thomas L. Magnanti
Fenchel and Lagrange duality are equivalent. Math. Program. 7 (1) (1974)
Daniel J. Kleitman, Thomas L. Magnanti
On the Number of Latent Subsets of Intersecting Collections. J. Comb. Theory, Ser. A 16 (2) (1974)
Thomas L. Magnanti
Publications. Math. Program. 2 (1) (1972)
George B. Dantzig, Stanley C. Eisenstat, Thomas L. Magnanti, Steven F. Maier, Michael B. McGrath
The Mathematical Programming Language (MPL). ACM Annual Conference (1971)