Magnanti Thomas L.

Thomas L. Magnanti

Information about the author Thomas L. Magnanti will soon be added to the site.
Found 26 papers in total
Combined route capacity and route length models for unit demand vehicle routing problems
Combined route capacity and route length models for unit demand vehicle routing problems
2008
We consider two types of hop-indexed models for the unit-demand asymmetric Capacitated...
Variable disaggregation in network flow problems with piecewise linear costs
Variable disaggregation in network flow problems with piecewise linear costs
2007
We study mixed-integer programming formulations, based upon variable disaggregation,...
A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
2003
We study a generic minimization problem with separable nonconvex piecewise linear...
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
2006
In a previous paper, Gouveia and Magnanti found diameter-constrained minimal spanning...
Inventory placement in acyclic supply chain networks
Inventory placement in acyclic supply chain networks
2006
By adding a set of redundant constraints, and by iteratively refining the...
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
2004
In a previous article, using underlying graph theoretical properties, Gouveia and...
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees
2003
We formulate and computationally test several models for the Diameter-Constrained...
Spare-capacity assignment for line restoration using a single-facility type
Spare-capacity assignment for line restoration using a single-facility type
2002
The network restoration problem is a specialized capacitated network design problem...
Facets and reformulations for solving production planning with changeover costs
Facets and reformulations for solving production planning with changeover costs
2002
We study a scheduling problem with changeover costs and capacity constraints. The...
Telecommunication link restoration planning with multiple facility types
Telecommunication link restoration planning with multiple facility types
2001
To ensure uninterrupted service, telecommunication networks contain excess (spare)...
Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
2001
An intuitive solution-doubling argument establishes well known results concerning the...
Designing hierarchical survivable networks
Designing hierarchical survivable networks
1998
As the computer, communication, and entertainment industries begin to integrate phone,...
A decomposition algorithm for local access telecommunications network expansion planning
A decomposition algorithm for local access telecommunications network expansion planning
1995
Growing demand, increasing diversity of services, and advances in transmission and...
Modeling and solving the two-facility capacitated network loading problem
Modeling and solving the two-facility capacitated network loading problem
1995
This paper studies a topical and economically significant capacitated network design...
A decomposition algorithm for local access telecommunications network expansion planning
A decomposition algorithm for local access telecommunications network expansion planning
1995
Growing demand, increasing diversity of services, and advances in transmission and...
Modeling and solving the two-facility capacitated network loading problem
Modeling and solving the two-facility capacitated network loading problem
1995
This paper studies a topical and economically significant capacitated network design...
A unifying geometric solution framework and complexity analysis for variational inequalities
A unifying geometric solution framework and complexity analysis for variational inequalities
1995
In this paper, the authors propose a concept of polynomiality for variational...
Optimizing constrained subtrees of trees
Optimizing constrained subtrees of trees
1995
Given a tree G=(V,E) and a weight function defined on subsets of its nodes, the...
Modeling and heuristic worst-case performance analysis of the Two-level Network Design problem
Modeling and heuristic worst-case performance analysis of the Two-level Network Design problem
1994
This paper studies a multi-facility network synthesis problem, called the Two-level...
A dual-based algorithm for Multi-level Network Design
A dual-based algorithm for Multi-level Network Design
1994
Given an undirected network with L possible facility types for each edge, and a...
The convex hull of two core capacitated network design problems
The convex hull of two core capacitated network design problems
1993
The network loading problem (NLP) is a specialized capacitated network design problem...
Sensitivity analysis for variational inequalities
Sensitivity analysis for variational inequalities
1992
This paper studies the behavior of the local solutions of perturbed variational...
Routing in point-to-point delivery systems: Formulations and solution heuristics
Routing in point-to-point delivery systems: Formulations and solution heuristics
1990
The authors develop an optimization-based approach for a point-to-point route planning...
Valid inequalities and facets of the capacitated plant location problem
Valid inequalities and facets of the capacitated plant location problem
1989
Recently, several successful applications of strong cutting plane methods to...
Papers per page: