default search action
Thomas L. Magnanti
Person information
- affiliation: Sloan School of Management, MIT, Cambridge, MA, USA
- award (1993): Frederick W. Lanchester Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j58]Retsef Levi
, Thomas L. Magnanti
Scheduling with Testing of Heterogeneous Jobs. Manag. Sci. 70(5): 2934-2953 (2024) - 2021
- [j57]Thomas L. Magnanti
Optimization: From Its Inception. Manag. Sci. 67(9): 5349-5363 (2021)
2010 – 2019
- 2019
- [j56]Retsef Levi
Scheduling with Testing. Manag. Sci. 65(2): 776-793 (2019) - 2018
- [j55]Thomas L. Magnanti
Allocating Students to Multidisciplinary Capstone Projects Using Discrete Optimization. Interfaces 48(3): 204-216 (2018) - 2013
- [c3]Flora S. Tsai, Karthik Natarajan
From Boxes to bees: Active learning in freshmen calculus. EDUCON 2013: 59-68
2000 – 2009
- 2009
- [r2]Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin:
Maximum Flow Problem. Encyclopedia of Optimization 2009: 2009-2020 - [r1]Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin:
Minimum Cost Flow Problem. Encyclopedia of Optimization 2009: 2095-2108 - 2008
- [j54]Maria Teresa Godinho
Combined route capacity and route length models for unit demand vehicle routing problems. Discret. Optim. 5(2): 350-372 (2008) - 2007
- [j53]Keely L. Croxton
Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs. Oper. Res. 55(1): 146-157 (2007) - 2006
- [j52]Luis Eduardo Neves Gouveia
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. Ann. Oper. Res. 146(1): 19-39 (2006) - [j51]Thomas L. Magnanti, Zuo-Jun Max Shen
Inventory placement in acyclic supply chain networks. Oper. Res. Lett. 34(2): 228-238 (2006) - 2005
- [j50]Thomas L. Magnanti, S. Raghavan:
Strong formulations for network design problems with connectivity requirements. Networks 45(2): 61-79 (2005) - 2004
- [j49]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) - [j48]Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani:
Connectivity-splitting models for survivable network design. Networks 43(1): 10-27 (2004) - [j47]Luis Eduardo Neves Gouveia
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. Networks 44(4): 254-265 (2004) - [c2]Thomas L. Magnanti, Dan Stratila:
Separable Concave Optimization Approximately Equals Piecewise Linear Optimization. IPCO 2004: 234-243 - 2003
- [j46]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): 1268-1273 (2003) - [j45]Luis Eduardo Neves Gouveia
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Networks 41(3): 159-173 (2003) - [j44]Keely L. Croxton
Models and Methods for Merge - in - Transit Operations. Transp. Sci. 37(1): 1-22 (2003) - 2002
- [j43]Anantaram Balakrishnan, Thomas L. Magnanti, Joel S. Sokol
Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type. Oper. Res. 50(4): 617-635 (2002) - [j42]Thomas L. Magnanti, Trilochan Sastry:
Facets and Reformulations for Solving Production Planning With Changeover Costs. Oper. Res. 50(4): 708-719 (2002) - 2001
- [j41]Anantaram Balakrishnan, Thomas L. Magnanti, Joel S. Sokol
Telecommunication Link Restoration Planning with Multiple Facility Types. Ann. Oper. Res. 106(1-4): 127-154 (2001) - [j40]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)
1990 – 1999
- 1998
- [j39]Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani:
Designing Hierarchical Survivable Networks. Oper. Res. 46(1): 116-136 (1998) - 1997
- [j38]Thomas L. Magnanti, Georgia Perakis:
Averaging Schemes for Variational Inequalities and Systems of Equations. Math. Oper. Res. 22(3): 568-587 (1997) - [j37]Thomas L. Magnanti, Georgia Perakis:
The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms. SIAM J. Optim. 7(1): 248-273 (1997) - 1996
- [j36]Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani:
Heuristics, LPs, and Trees on Trees: Network Design Analyses. Oper. Res. 44(3): 478-496 (1996) - 1995
- [j35]Anantaram Balakrishnan, Thomas L. Magnanti, Richard T. Wong:
A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning. Oper. Res. 43(1): 58-76 (1995) - [j34]Thomas L. Magnanti, Prakash Mirchandani, Rita Vachani:
Modeling and Solving the Two-Facility Capacitated Network Loading Problem. Oper. Res. 43(1): 142-157 (1995) - [j33]El Houssaine Aghezzaf
Optimizing constrained subtrees of trees. Math. Program. 71: 113-126 (1995) - [j32]Thomas L. Magnanti, Georgia Perakis:
A unifying geometric solution framework and complexity analysis for variational inequalities. Math. Program. 71: 327-351 (1995) - 1993
- [b1]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 - [j31]Thomas L. Magnanti, Prakash Mirchandani, Rita Vachani:
The convex hull of two core capacitated network design problems. Math. Program. 60: 233-250 (1993) - [j30]Thomas L. Magnanti, Prakash Mirchandani:
Shortest paths, single origin-destination network design, and associated polyhedra. Networks 23(2): 103-121 (1993) - 1992
- [j29]Yuping Qiu, Thomas L. Magnanti:
Sensitivity Analysis for Variational Inequalities. Math. Oper. Res. 17(1): 61-76 (1992) - [j28]Leslie A. Hall, Thomas L. Magnanti:
A Polyhedral Intersection Theorem for Capacitated Spanning Trees. Math. Oper. Res. 17(2): 398-410 (1992) - 1991
- [j27]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): 237-284 (1991) - [j26]Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin:
Some Recent Advances in Network Flows. SIAM Rev. 33(2): 175-219 (1991) - 1990
- [j25]Thomas L. Magnanti, Rita Vachani:
A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs. Oper. Res. 38(3): 456-473 (1990) - [j24]Janny M. Y. Leung
Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics. Transp. Sci. 24(4): 245-260 (1990)
1980 – 1989
- 1989
- [j23]Anantaram Balakrishnan, Thomas L. Magnanti, Richard T. Wong:
A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design. Oper. Res. 37(5): 716-740 (1989) - [j22]Yuping Qiu, Thomas L. Magnanti:
Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets. Math. Oper. Res. 14(3): 410-432 (1989) - [j21]Janny M. Y. Leung
Valid inequalities and facets of the capacitated plant location problem. Math. Program. 44(1-3): 271-291 (1989) - [j20]Janny M. Y. Leung
Facets and algorithms for capacitated lot sizing. Math. Program. 45(1-3): 331-359 (1989) - [j19]Marcia P. Helme, Thomas L. Magnanti:
Designing satellite communication networks by zero - one quadratic programming. Networks 19(4): 427-450 (1989) - 1988
- [j18]Thomas L. Magnanti, James B. Orlin
Parametric linear programming and anti-cycling pivoting rules. Math. Program. 41(1-3): 317-325 (1988) - [j17]Mordecai Haimovich, Thomas L. Magnanti:
Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location. SIAM J. Discret. Math. 1(1): 50-64 (1988) - [j16]K. Nabil Ali Safwat, Thomas L. Magnanti:
A Combined Trip Generation, Trip Distribution, Modal Split, and Trip Assignment Model. Transp. Sci. 22(1): 14-30 (1988) - 1987
- [j15]Thomas L. Magnanti:
Editorial. Oper. Res. 35(1) (1987) - [j14]Janice H. Hammond, Thomas L. Magnanti:
Generalized Descent Methods for Asymmetric Systems of Equations. Math. Oper. Res. 12(4): 678-699 (1987) - 1986
- [j13]Thomas L. Magnanti:
Editorial. Oper. Res. 34(1): 2-3 (1986) - 1984
- [j12]Thomas L. Magnanti:
Editorial. Oper. Res. 32(1): 1-4 (1984) - [j11]Thomas L. Magnanti, Richard T. Wong
Network Design and Transportation Planning: Models and Algorithms. Transp. Sci. 18(1): 1-55 (1984) - 1981
- [j10]Thomas L. Magnanti, Richard T. Wong
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria. Oper. Res. 29(3): 464-484 (1981) - [j9]Arnoldo C. Hax, Thomas L. Magnanti, Linus Schrage:
Preface. Oper. Res. 29(4): 627 (1981) - [j8]Thomas L. Magnanti:
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects. Networks 11(2): 179-213 (1981)
1970 – 1979
- 1977
- [j7]Bruce L. Golden, Thomas L. Magnanti, H. Q. Nguyen:
Implementing vehicle routing algorithms. Networks 7(2): 113-148 (1977) - [j6]Bruce L. Golden, Thomas L. Magnanti:
Deterministic network optimization: A bibliography. Networks 7(2): 149-179 (1977) - 1976
- [j5]Gabriel R. Bitran, Thomas L. Magnanti:
Duality and Sensitivity Analysis for Fractional Programs. Oper. Res. 24(4): 675-699 (1976) - 1974
- [j4]Thomas L. Magnanti:
Complementary bases of a matroid. Discret. Math. 8(4): 355-361 (1974) - [j3]Daniel J. Kleitman, Thomas L. Magnanti:
On the Number of Latent Subsets of Intersecting Collections. J. Comb. Theory A 16(2): 215-220 (1974) - [j2]Thomas L. Magnanti:
Fenchel and Lagrange duality are equivalent. Math. Program. 7(1): 253-258 (1974) - 1972
- [j1]Thomas L. Magnanti:
Publications. Math. Program. 2(1): 130-132 (1972) - 1971
- [c1]George B. Dantzig, Stanley C. Eisenstat, Thomas L. Magnanti, Steven F. Maier, Michael B. McGrath:
The Mathematical Programming Language (MPL). ACM Annual Conference 1971: 278-283
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: