Thomas L. Magnanti - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 58 from 58

2024

Scheduling with Testing of Heterogeneous JobsRetsef Levi, Thomas L. Magnanti, Yaron Shaposhnik. mansci, 70(5):2934-2953, 2024. [doi]

2021

Optimization: From Its InceptionThomas L. Magnanti. mansci, 67(9):5349-5363, 2021. [doi]

2019

Scheduling with TestingRetsef Levi, Thomas L. Magnanti, Yaron Shaposhnik. mansci, 65(2):776-793, 2019. [doi]

2018

Allocating Students to Multidisciplinary Capstone Projects Using Discrete OptimizationThomas L. Magnanti, Karthik Natarajan. interfaces, 48(3):204-216, 2018. [doi]

2013

From Boxes to bees: Active learning in freshmen calculusFlora S. Tsai, Karthik Natarajan, Selin Damla Ahipasaoglu, Chau Yuen, Hyowon Lee, Ngai-Man Cheung, Justin Ruths, Shisheng Huang, Thomas L. Magnanti. educon 2013: 59-68 [doi]

2008

Combined route capacity and route length models for unit demand vehicle routing problemsMaria Teresa Godinho, Luis Gouveia, Thomas L. Magnanti. disopt, 5(2):350-372, 2008. [doi]

2007

Variable Disaggregation in Network Flow Problems with Piecewise Linear CostsKeely L. Croxton, Bernard Gendron, Thomas L. Magnanti. ior, 55(1):146-157, 2007. [doi]

2006

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner treesLuís Gouveia, Thomas L. Magnanti, Cristina Requejo. anor, 146(1):19-39, 2006. [doi]

Inventory placement in acyclic supply chain networksThomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, David Simchi-Levi, Chung-Piaw Teo. orl, 34(2):228-238, 2006. [doi]

2005

Strong formulations for network design problems with connectivity requirementsThomas L. Magnanti, S. Raghavan. networks, 45(2):61-79, 2005. [doi]

2004

2003

A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization ProblemsKeely L. Croxton, Bernard Gendron, Thomas L. Magnanti. mansci, 49(9):1268-1273, 2003. [doi]

Models and Methods for Merge - in - Transit OperationsKeely L. Croxton, Bernard Gendron, Thomas L. Magnanti. transci, 37(1):1-22, 2003. [doi]

Network flow models for designing diameter-constrained minimum-spanning and Steiner treesLuis Gouveia, Thomas L. Magnanti. networks, 41(3):159-173, 2003. [doi]

2002

Spare-Capacity Assignment For Line Restoration Using a Single-Facility TypeAnantaram Balakrishnan, Thomas L. Magnanti, Joel S. Sokol, Yi Wang. ior, 50(4):617-635, 2002. [doi]

Facets and Reformulations for Solving Production Planning With Changeover CostsThomas L. Magnanti, Trilochan Sastry. ior, 50(4):708-719, 2002. [doi]

2001

Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problemsAnantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani. orl, 29(3):99-106, 2001. [doi]

Telecommunication Link Restoration Planning with Multiple Facility TypesAnantaram Balakrishnan, Thomas L. Magnanti, Joel S. Sokol, Yi Wang. anor, 106(1-4):127-154, 2001. [doi]

1998

Designing Hierarchical Survivable NetworksAnantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani. ior, 46(1):116-136, 1998. [doi]

1997

Averaging Schemes for Variational Inequalities and Systems of EquationsThomas L. Magnanti, Georgia Perakis. mor, 22(3):568-587, 1997. [doi]

The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality AlgorithmsThomas L. Magnanti, Georgia Perakis. siamjo, 7(1):248-273, 1997. [doi]

1996

Heuristics, LPs, and Trees on Trees: Network Design AnalysesAnantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani. ior, 44(3):478-496, 1996. [doi]

1995

1993

Network flows - theory, algorithms and applicationsRavindra K. Ahuja, Thomas L. Magnanti, James B. Orlin. Prentice Hall, 1993.

The convex hull of two core capacitated network design problemsThomas L. Magnanti, Prakash Mirchandani, Rita Vachani. mp, 60:233-250, 1993.

Shortest paths, single origin-destination network design, and associated polyhedraThomas L. Magnanti, Prakash Mirchandani. networks, 23(2):103-121, 1993. [doi]

1992

A Polyhedral Intersection Theorem for Capacitated Spanning TreesLeslie A. Hall, Thomas L. Magnanti. mor, 17(2):398-410, 1992. [doi]

Sensitivity Analysis for Variational InequalitiesYuping Qiu, Thomas L. Magnanti. mor, 17(1):61-76, 1992. [doi]

1991

Some Recent Advances in Network FlowsRavindra K. Ahuja, Thomas L. Magnanti, James B. Orlin. siamrev, 33(2):175-219, 1991. [doi]

Models for planning capacity expansion in local access telecommunication networksA. Balakrishnan, Thomas L. Magnanti, A. Shulman, Richard T. Wong. anor, 33(4):237-284, 1991. [doi]

1990

Routing in Point-to-Point Delivery Systems: Formulations and Solution HeuristicsJanny M. Y. Leung, Thomas L. Magnanti, Vijay Singhal. transci, 24(4):245-260, 1990. [doi]

A Strong Cutting Plane Algorithm for Production Scheduling with Changeover CostsThomas L. Magnanti, Rita Vachani. ior, 38(3):456-473, 1990. [doi]

1989

A Dual-Ascent Procedure for Large-Scale Uncapacitated Network DesignAnantaram Balakrishnan, Thomas L. Magnanti, Richard T. Wong. ior, 37(5):716-740, 1989. [doi]

Designing satellite communication networks by zero - one quadratic programmingMarcia P. Helme, Thomas L. Magnanti. networks, 19(4):427-450, 1989. [doi]

Facets and algorithms for capacitated lot sizingJanny M. Y. Leung, Thomas L. Magnanti, Rita Vachani. mp, 45(1-3):331-359, 1989. [doi]

Valid inequalities and facets of the capacitated plant location problemJanny M. Y. Leung, Thomas L. Magnanti. mp, 44(1-3):271-291, 1989. [doi]

Sensitivity Analysis for Variational Inequalities Defined on Polyhedral SetsYuping Qiu, Thomas L. Magnanti. mor, 14(3):410-432, 1989. [doi]

1988

Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean LocationM. Haimovich, Thomas L. Magnanti. siamdm, 1(1):50-64, 1988.

Parametric linear programming and anti-cycling pivoting rulesThomas L. Magnanti, James B. Orlin. mp, 41(1-3):317-325, 1988. [doi]

A Combined Trip Generation, Trip Distribution, Modal Split, and Trip Assignment ModelK. Nabil Ali Safwat, Thomas L. Magnanti. transci, 22(1):14-30, 1988. [doi]

1987

Generalized Descent Methods for Asymmetric Systems of EquationsJanice H. Hammond, Thomas L. Magnanti. mor, 12(4):678-699, 1987. [doi]

EditorialThomas L. Magnanti. ior, 35(1), 1987. [doi]

1986

EditorialThomas L. Magnanti. ior, 34(1):2-3, 1986. [doi]

1984

EditorialThomas L. Magnanti. ior, 32(1):1-4, 1984. [doi]

Network Design and Transportation Planning: Models and AlgorithmsThomas L. Magnanti, Richard T. Wong. transci, 18(1):1-55, 1984. [doi]

1981

PrefaceArnoldo C. Hax, Thomas L. Magnanti, Linus Schrage. ior, 29(4):627, 1981. [doi]

Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection CriteriaThomas L. Magnanti, Richard T. Wong. ior, 29(3):464-484, 1981. [doi]

1976

Duality and Sensitivity Analysis for Fractional ProgramsGabriel R. Bitran, Thomas L. Magnanti. ior, 24(4):675-699, 1976. [doi]

1974

Complementary bases of a matroidThomas L. Magnanti. DM, 8(4):355-361, 1974. [doi]

Fenchel and Lagrange duality are equivalentThomas L. Magnanti. mp, 7(1):253-258, 1974. [doi]

1972

PublicationsThomas L. Magnanti. mp, 2(1):130-132, 1972. [doi]

1971

The Mathematical Programming Language (MPL)George B. Dantzig, Stanley C. Eisenstat, Thomas L. Magnanti, Steven F. Maier, Michael B. McGrath. acm 1971: 278-283 [doi]

Sign in or sign up to see more results.

runs on WebDSL