Prahalad Venkateshan, Ph.D.
Affiliations: | 2007 | Case Western Reserve University, Cleveland Heights, OH, United States |
Area:
Operations ResearchGoogle:
"Prahalad Venkateshan"Parents
Sign in to add mentorKamlesh Mathur | grad student | 2007 | Case Western | |
(Three essays in mathematical logistics.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Venkateshan P. (2020) A Note on “The Facility Location Problem with Limited Distances” Transportation Science |
Agarwal YK, Venkateshan P. (2020) A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries Operations Research Letters. 48: 48-54 |
Venkateshan P, Szmerekovsky JG, Vairaktarakis GL. (2020) A cutting plane approach for the multi-machine precedence-constrained scheduling problem Annals of Operations Research. 285: 247-271 |
Agarwal YK, Venkateshan P. (2019) New Valid Inequalities for the Optimal Communication Spanning Tree Problem Informs Journal On Computing. 31: 268-284 |
Venkateshan P, Ballou RH, Mathur K, et al. (2017) A Two-echelon joint continuous-discrete location model European Journal of Operational Research. 262: 1028-1039 |
Agarwal YK, Venkateshan P. (2016) Near optimal design of wavelength routed optical networks European Journal of Operational Research. 250: 990-1000 |
Venkateshan P, Mathur K. (2015) A heuristic for the multisource weber problem with service level constraints Transportation Science. 49: 472-483 |
Szmerekovsky JG, Venkateshan P. (2015) The discrete time-cost tradeoff problem with irregular starting time costs Handbook On Project Management and Scheduling Vol. 1. 621-638 |
Agarwal YK, Venkateshan P. (2014) Survivable network design with shared-protection routing European Journal of Operational Research. 238: 836-845 |
Szmerekovsky JG, Venkateshan P. (2012) An integer programming formulation for the project scheduling problem with irregular timecost tradeoffs Computers and Operations Research. 39: 1402-1410 |