The following pages link to Prahalad Venkateshan (Q296896):
Displaying 13 items.
- Survivable network design with shared-protection routing (Q296897) (← links)
- Near optimal design of wavelength routed optical networks (Q322603) (← links)
- An efficient column-generation-based algorithm for solving a pickup-and-delivery problem (Q547107) (← links)
- A new lower bound for the linear knapsack problem with general integer variables (Q859686) (← links)
- An efficient generalized network-simplex-based algorithm for manufacturing network flows (Q927190) (← links)
- Locating and staffing service centers under service level constraints (Q1044135) (← links)
- A two-echelon joint continuous-discrete location model (Q1683143) (← links)
- An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs (Q1762128) (← links)
- A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries (Q2294528) (← links)
- New Valid Inequalities for the Optimal Communication Spanning Tree Problem (Q5138258) (← links)
- New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries (Q6065909) (← links)
- Project scheduling under the threat of catastrophic disruption (Q6112627) (← links)
- Integrated inventory replenishment and online demand allocation decisions for an omnichannel retailer with ship-from-store strategy (Q6565452) (← links)
