Prahalad Venkateshan

According to our database, Prahalad Venkateshan authored at least 18 papers between 2007 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Vehicle Routing Problem With Time Windows - New Valid Inequalities From Polar Duality.

Yogesh Kumar Agarwal, Prahalad Venkateshan

Networks, 2026

2024

Modelling driver's reactive strategies in e-hailing platforms: an agent-based simulation model and an approximate analytical model.

Arulanantha P. P. Maruthasalam, Debjit Roy, Prahalad Venkateshan

Int. J. Prod. Res., 2024

Integrated inventory replenishment and online demand allocation decisions for an omnichannel retailer with ship-from-store strategy.

Vishal Bansal, Arnab Bisi, Debjit Roy, Prahalad Venkateshan

Eur. J. Oper. Res., 2024

2023

Project scheduling under the threat of catastrophic disruption.

Joseph G. Szmerekovsky, Prahalad Venkateshan, Peter D. Simonson

Eur. J. Oper. Res., September, 2023

2022

New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries.

Yogesh Kumar Agarwal, Prahalad Venkateshan

Networks, 2022

2020

A Note on "The Facility Location Problem with Limited Distances".

Prahalad Venkateshan

Transp. Sci., 2020

A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries.

Yogesh Kumar Agarwal, Prahalad Venkateshan

Oper. Res. Lett., 2020

A cutting plane approach for the multi-machine precedence-constrained scheduling problem.

Prahalad Venkateshan, Joseph G. Szmerekovsky, George L. Vairaktarakis

Ann. Oper. Res., 2020

2019

New Valid Inequalities for the Optimal Communication Spanning Tree Problem.

Yogesh Kumar Agarwal, Prahalad Venkateshan

INFORMS J. Comput., 2019

2017

A Two-echelon joint continuous-discrete location model.

Prahalad Venkateshan, Ronald H. Ballou, Kamlesh Mathur, Arulanantha P. P. Maruthasalam

Eur. J. Oper. Res., 2017

2016

Near optimal design of wavelength routed optical networks.

Yogesh Kumar Agarwal, Prahalad Venkateshan

Eur. J. Oper. Res., 2016

2015

A Heuristic for the Multisource Weber Problem with Service Level Constraints.

Prahalad Venkateshan, Kamlesh Mathur

Transp. Sci., 2015

2014

Survivable network design with shared-protection routing.

Yogesh Kumar Agarwal, Prahalad Venkateshan

Eur. J. Oper. Res., 2014

2012

An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs.

Joseph G. Szmerekovsky, Prahalad Venkateshan

Comput. Oper. Res., 2012

2011

An efficient column-generation-based algorithm for solving a pickup-and-delivery problem.

Prahalad Venkateshan, Kamlesh Mathur

Comput. Oper. Res., 2011

2010

Locating and staffing service centers under service level constraints.

Prahalad Venkateshan, Kamlesh Mathur, Ronald H. Ballou

Eur. J. Oper. Res., 2010

2008

An efficient generalized network-simplex-based algorithm for manufacturing network flows.

Prahalad Venkateshan, Kamlesh Mathur, Ronald H. Ballou

J. Comb. Optim., 2008

2007

A new lower bound for the linear knapsack problem with general integer variables.

Kamlesh Mathur, Prahalad Venkateshan

Eur. J. Oper. Res., 2007