Prahalad Venkateshan

18 papers Journal 18
YearRankTypeTitle / Venue / Authors
2026 J jnl
Vehicle Routing Problem With Time Windows - New Valid Inequalities From Polar Duality.
Networks
Yogesh Kumar Agarwal, Prahalad Venkateshan
2024 J jnl
Integrated inventory replenishment and online demand allocation decisions for an omnichannel retailer with ship-from-store strategy.
Eur. J. Oper. Res.
Vishal Bansal, Arnab Bisi, Debjit Roy, Prahalad Venkateshan
2024 J jnl
Modelling driver's reactive strategies in e-hailing platforms: an agent-based simulation model and an approximate analytical model.
Int. J. Prod. Res.
Arulanantha P. P. Maruthasalam, Debjit Roy, Prahalad Venkateshan
2023 J jnl
Project scheduling under the threat of catastrophic disruption.
Eur. J. Oper. Res.
Joseph G. Szmerekovsky, Prahalad Venkateshan, Peter D. Simonson
2022 J jnl
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries.
Networks
Yogesh Kumar Agarwal, Prahalad Venkateshan
2020 J jnl
A Note on "The Facility Location Problem with Limited Distances".
Transp. Sci.
Prahalad Venkateshan
2020 J jnl
A cutting plane approach for the multi-machine precedence-constrained scheduling problem.
Ann. Oper. Res.
Prahalad Venkateshan, Joseph G. Szmerekovsky, George L. Vairaktarakis
2020 J jnl
A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries.
Oper. Res. Lett.
Yogesh Kumar Agarwal, Prahalad Venkateshan
2019 J jnl
New Valid Inequalities for the Optimal Communication Spanning Tree Problem.
INFORMS J. Comput.
Yogesh Kumar Agarwal, Prahalad Venkateshan
2017 J jnl
A Two-echelon joint continuous-discrete location model.
Eur. J. Oper. Res.
Prahalad Venkateshan, Ronald H. Ballou, Kamlesh Mathur, Arulanantha P. P. Maruthasalam
2016 J jnl
Near optimal design of wavelength routed optical networks.
Eur. J. Oper. Res.
Yogesh Kumar Agarwal, Prahalad Venkateshan
2015 J jnl
A Heuristic for the Multisource Weber Problem with Service Level Constraints.
Transp. Sci.
Prahalad Venkateshan, Kamlesh Mathur
2014 J jnl
Survivable network design with shared-protection routing.
Eur. J. Oper. Res.
Yogesh Kumar Agarwal, Prahalad Venkateshan
2012 J jnl
An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs.
Comput. Oper. Res.
Joseph G. Szmerekovsky, Prahalad Venkateshan
2011 J jnl
An efficient column-generation-based algorithm for solving a pickup-and-delivery problem.
Comput. Oper. Res.
Prahalad Venkateshan, Kamlesh Mathur
2010 J jnl
Locating and staffing service centers under service level constraints.
Eur. J. Oper. Res.
Prahalad Venkateshan, Kamlesh Mathur, Ronald H. Ballou
2008 J jnl
An efficient generalized network-simplex-based algorithm for manufacturing network flows.
J. Comb. Optim.
Prahalad Venkateshan, Kamlesh Mathur, Ronald H. Ballou
2007 J jnl
A new lower bound for the linear knapsack problem with general integer variables.
Eur. J. Oper. Res.
Kamlesh Mathur, Prahalad Venkateshan