The following pages link to Anantaram Balakrishnan (Q221930):
Displayed 29 items.
- Models and algorithms for network reduction (Q320811) (← links)
- Telecommunication link restoration planning with multiple facility types (Q1599304) (← links)
- Container shipping service selection and cargo routing with transshipment limits (Q1694945) (← links)
- Designing Hierarchical Survivable Networks (Q2781139) (← links)
- “Stack Them High, Let ’em Fly”: Lot-Sizing Policies When Inventories Stimulate Demand (Q3114896) (← links)
- Information tradeoffs in model building: A network routing application (Q3354612) (← links)
- Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type (Q3635123) (← links)
- Production Planning with Flexible Product Specifications: An Application to Specialty Steel Manufacturing (Q3635175) (← links)
- LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)
- Problem reduction methods and a tree generation algorithm for the steiner network problem (Q3786299) (← links)
- An Integrated Inventory Allocation and Vehicle Routing Problem (Q3821902) (← links)
- A composite algorithm for a concave-cost network flow problem (Q3827773) (← links)
- Preemptive Scheduling of Hybrid Parallel Machines (Q3827789) (← links)
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design (Q4030790) (← 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)
- Bottleneck Resource Allocation in Manufacturing (Q4363727) (← links)
- (Q4398375) (← links)
- Connectivity-splitting models for survivable network design (Q4446914) (← links)
- A Tactical Planning Model for Mixed-Model Electronics Assembly Operations (Q4545683) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design (Q4731020) (← links)
- (Q4793378) (← links)
- A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning (Q4838237) (← links)
- Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models (Q5080634) (← links)
- Connectivity Upgrade Models for Survivable Network Design (Q5188992) (← links)
- Heuristics, LPs, and Trees on Trees: Network Design Analyses (Q5689795) (← links)
- Selecting Ingot Sizes for Joint Production of Sheet Products (Q5690270) (← links)
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems (Q5952066) (← links)