The following pages link to Thomas L. Magnanti (Q221931):
Displaying 17 items.
- Connectivity-splitting models for survivable network design (Q4446914) (← links)
- Maintenance scheduling for modular systems: Modeling and algorithms (Q4632854) (← links)
- Maintenance and flight scheduling of low observable aircraft (Q4632883) (← links)
- (Q4635958) (← links)
- (Q4635959) (← links)
- (Q4635960) (← links)
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design (Q4731020) (← links)
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees (Q4808431) (← links)
- (Q4811406) (← links)
- A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning (Q4838237) (← links)
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem (Q4838244) (← links)
- (Q4845371) (← links)
- Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics (Q5202007) (← links)
- Shortest paths, single origin‐destination network design, and associated polyhedra (Q5287444) (← links)
- Heuristics, LPs, and Trees on Trees: Network Design Analyses (Q5689795) (← links)
- Integer Programming and Combinatorial Optimization (Q5712456) (← links)
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems (Q5952066) (← links)