The following pages link to Thomas L. Magnanti (Q221931):
Displaying 50 items.
- The convex hull of two core capacitated network design problems (Q689128) (← links)
- An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees (Q863567) (← links)
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- (Q1108190) (redirect page) (← links)
- Parametric linear programming and anti-cycling pivoting rules (Q1108192) (← links)
- Complementary bases of a matroid (Q1212466) (← links)
- The structure of admissible points with respect to cone dominance (Q1250997) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- Telecommunication link restoration planning with multiple facility types (Q1599304) (← links)
- Solving variational inequality and fixed point problems by line searches and potential optimization (Q1764238) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- On the number of latent subsets of intersecting collections (Q1843569) (← links)
- Optimizing constrained subtrees of trees (Q1914069) (← links)
- A unifying geometric solution framework and complexity analysis for variational inequalities (Q1919807) (← links)
- Designing Hierarchical Survivable Networks (Q2781139) (← links)
- (Q3056948) (← links)
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems (Q3114873) (← links)
- The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms (Q3124045) (← links)
- A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees (Q3157034) (← links)
- Approximation Methods for the Uncapacitated Dynamic Lot Size Problem (Q3342178) (← links)
- (Q3352833) (← links)
- Some Recent Advances in Network Flows (Q3359973) (← links)
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs (Q3392064) (← links)
- Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets (Q3476611) (← links)
- Routing and Scheduling on a Shoreline with Release Times (Q3479797) (← links)
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs (Q3489777) (← links)
- Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type (Q3635123) (← links)
- Facets and Reformulations for Solving Production Planning With Changeover Costs (Q3635131) (← links)
- Tailoring Benders decomposition for uncapacitated network design (Q3730370) (← links)
- (Q3734142) (← links)
- Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location (Q3778515) (← links)
- (Q3780724) (← links)
- Generalized Descent Methods for Asymmetric Systems of Equations (Q3783429) (← links)
- Designing satellite communication networks by zero—one quadratic programming (Q3823407) (← links)
- (Q3875725) (← links)
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria (Q3904383) (← links)
- Equilibria on a Congested Transportation Network (Q3967332) (← links)
- A Polyhedral Intersection Theorem for Capacitated Spanning Trees (Q4016701) (← links)
- Sensitivity Analysis for Variational Inequalities (Q4016710) (← links)
- Fenchel and Lagrange duality are equivalent (Q4050398) (← links)
- Complementary Trees and Independent Matchings (Q4063168) (← links)
- Some Abstract Pivot Algorithms (Q4103542) (← links)
- (Q4109502) (← links)
- (Q4111040) (← links)
- Duality and Sensitivity Analysis for Fractional Programs (Q4135251) (← links)
- Deterministic network optimization: A bibliography (Q4136979) (← links)
- A Dual-Based Algorithm for Multi-Level Network Design (Q4302659) (← links)
- Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem (Q4319533) (← links)
- Averaging Schemes for Variational Inequalities and Systems of Equations (Q4361785) (← links)
- (Q4398375) (← links)
