Thomas L. Magnanti

Manag. Sci., 2021

2019

Scheduling with Testing.

[BibT_eX]

[DOI]

Retsef Levi

Yaron Shaposhnik

Manag. Sci., 2019

2018

Allocating Students to Multidisciplinary Capstone Projects Using Discrete Optimization.

[BibT_eX]

[DOI]

Karthik Natarajan

Interfaces, 2018

2013

From Boxes to bees: Active learning in freshmen calculus.

[BibT_eX]

[DOI]

Flora S. Tsai

Karthik Natarajan

Selin Damla Ahipasaoglu

Proceedings of the IEEE Global Engineering Education Conference, 2013

2009

Minimum Cost Flow Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Maximum Flow Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2008

Combined route capacity and route length models for unit demand vehicle routing problems.

[BibT_eX]

[DOI]

Maria Teresa Godinho

Discret. Optim., 2008

2007

Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs.

[BibT_eX]

[DOI]

Keely L. Croxton

Bernard Gendron

Oper. Res., 2007

2006

Inventory placement in acyclic supply chain networks.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees.

[BibT_eX]

[DOI]

Cristina Requejo

Ann. Oper. Res., 2006

2005

Strong formulations for network design problems with connectivity requirements.

[BibT_eX]

[DOI]

S. Raghavan

Networks, 2005

2004

A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees.

[BibT_eX]

[DOI]

Cristina Requejo

Networks, 2004

Connectivity-splitting models for survivable network design.

[BibT_eX]

[DOI]

Networks, 2004

Solving variational inequality and fixed point problems by line searches and potential optimization.

[BibT_eX]

[DOI]

Math. Program., 2004

Separable Concave Optimization Approximately Equals Piecewise Linear Optimization.

[BibT_eX]

[DOI]

Dan Stratila

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003

Models and Methods for Merge - in - Transit Operations.

[BibT_eX]

[DOI]

Keely L. Croxton

Bernard Gendron

Transp. Sci., 2003

Network flow models for designing diameter-constrained minimum-spanning and Steiner trees.

[BibT_eX]

[DOI]

Networks, 2003

A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems.

[BibT_eX]

[DOI]

Keely L. Croxton

Bernard Gendron

Manag. Sci., 2003

2002

Facets and Reformulations for Solving Production Planning With Changeover Costs.

[BibT_eX]

[DOI]

Trilochan Sastry

Oper. Res., 2002

Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type.

[BibT_eX]

[DOI]

Joel S. Sokol

Yi Wang

Oper. Res., 2002

2001

Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2001

Telecommunication Link Restoration Planning with Multiple Facility Types.

[BibT_eX]

[DOI]

Joel S. Sokol

Yi Wang

Ann. Oper. Res., 2001

1998

Designing Hierarchical Survivable Networks.

[BibT_eX]

[DOI]

Oper. Res., 1998

1997

The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms.

[BibT_eX]

[DOI]

SIAM J. Optim., 1997

Averaging Schemes for Variational Inequalities and Systems of Equations.

[BibT_eX]

[DOI]

Math. Oper. Res., 1997

1996

Heuristics, LPs, and Trees on Trees: Network Design Analyses.

[BibT_eX]

[DOI]

Oper. Res., 1996

1995

A unifying geometric solution framework and complexity analysis for variational inequalities.

[BibT_eX]

[DOI]

Math. Program., 1995

Optimizing constrained subtrees of trees.

[BibT_eX]

[DOI]

El Houssaine Aghezzaf

Laurence A. Wolsey

Math. Program., 1995

Modeling and Solving the Two-Facility Capacitated Network Loading Problem.

[BibT_eX]

[DOI]

Oper. Res., 1995

A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning.

[BibT_eX]

[DOI]

Oper. Res., 1995

1993

Shortest paths, single origin-destination network design, and associated polyhedra.

[BibT_eX]

[DOI]

Networks, 1993

The convex hull of two core capacitated network design problems.

[BibT_eX]

[DOI]

Math. Program., 1993

Network flows - theory, algorithms and applications.

[BibT_eX]

Prentice Hall, ISBN: 978-0-13-617549-0, 1993

1992

Sensitivity Analysis for Variational Inequalities.

[BibT_eX]

[DOI]

Yuping Qiu

Math. Oper. Res., 1992

A Polyhedral Intersection Theorem for Capacitated Spanning Trees.

[BibT_eX]

[DOI]

Leslie A. Hall

Math. Oper. Res., 1992

1991

Some Recent Advances in Network Flows.

[BibT_eX]

[DOI]

SIAM Rev., 1991

Models for planning capacity expansion in local access telecommunication networks.

[BibT_eX]

[DOI]

A. Shulman

Ann. Oper. Res., 1991

1990

Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics.

[BibT_eX]

[DOI]

Janny M. Y. Leung

Vijay Singhal

Transp. Sci., 1990

A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs.

[BibT_eX]

[DOI]

Oper. Res., 1990

1989

Designing satellite communication networks by zero - one quadratic programming.

[BibT_eX]

[DOI]

Marcia P. Helme

Networks, 1989

Facets and algorithms for capacitated lot sizing.

[BibT_eX]

[DOI]

Janny M. Y. Leung

Math. Program., 1989

Valid inequalities and facets of the capacitated plant location problem.

[BibT_eX]

[DOI]

Janny M. Y. Leung

Math. Program., 1989

Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets.

[BibT_eX]

[DOI]

Yuping Qiu

Math. Oper. Res., 1989

A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design.

[BibT_eX]

[DOI]

Oper. Res., 1989

1988

A Combined Trip Generation, Trip Distribution, Modal Split, and Trip Assignment Model.

[BibT_eX]

[DOI]

K. Nabil Ali Safwat

Transp. Sci., 1988

Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location.

[BibT_eX]

[DOI]

Mordecai Haimovich

SIAM J. Discret. Math., 1988

Parametric linear programming and anti-cycling pivoting rules.

[BibT_eX]

[DOI]

Math. Program., 1988

1987

Generalized Descent Methods for Asymmetric Systems of Equations.

[BibT_eX]

[DOI]

Janice H. Hammond

Math. Oper. Res., 1987

Editorial.

[BibT_eX]

[DOI]

Oper. Res., 1987

1984

Network Design and Transportation Planning: Models and Algorithms.

[BibT_eX]

[DOI]

Transp. Sci., 1984

1981

Combinatorial optimization and vehicle fleet planning: Perspectives and prospects.

[BibT_eX]

[DOI]

Networks, 1981

Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria.

[BibT_eX]

[DOI]

Oper. Res., 1981

Preface.

[BibT_eX]

[DOI]

Arnoldo C. Hax

Linus Schrage

Oper. Res., 1981

1977

Implementing vehicle routing algorithms.

[BibT_eX]

[DOI]

Bruce L. Golden

H. Q. Nguyen

Networks, 1977

Deterministic network optimization: A bibliography.

[BibT_eX]

[DOI]

Bruce L. Golden

Networks, 1977

1976

Duality and Sensitivity Analysis for Fractional Programs.

[BibT_eX]

[DOI]

Gabriel R. Bitran

Oper. Res., 1976

1974

Fenchel and Lagrange duality are equivalent.

[BibT_eX]

[DOI]

Math. Program., 1974

On the Number of Latent Subsets of Intersecting Collections.

[BibT_eX]

[DOI]

Daniel J. Kleitman

J. Comb. Theory, Ser. A, 1974

Complementary bases of a matroid.

[BibT_eX]

[DOI]

Discret. Math., 1974

1972

Publications.

[BibT_eX]

[DOI]