Prahalad Venkateshan

Orcid: 0000-0002-9566-7451

According to our database1, Prahalad Venkateshan authored at least 15 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Project scheduling under the threat of catastrophic disruption.
Eur. J. Oper. Res., September, 2023

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

2020
A Note on "The Facility Location Problem with Limited Distances".
Transp. Sci., 2020

A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries.
Oper. Res. Lett., 2020

A cutting plane approach for the multi-machine precedence-constrained scheduling problem.
Ann. Oper. Res., 2020

2019
New Valid Inequalities for the Optimal Communication Spanning Tree Problem.
INFORMS J. Comput., 2019

2017
A Two-echelon joint continuous-discrete location model.
Eur. J. Oper. Res., 2017

2016
Near optimal design of wavelength routed optical networks.
Eur. J. Oper. Res., 2016

2015
A Heuristic for the Multisource Weber Problem with Service Level Constraints.
Transp. Sci., 2015

2014
Survivable network design with shared-protection routing.
Eur. J. Oper. Res., 2014

2012
An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs.
Comput. Oper. Res., 2012

2011
An efficient column-generation-based algorithm for solving a pickup-and-delivery problem.
Comput. Oper. Res., 2011

2010
Locating and staffing service centers under service level constraints.
Eur. J. Oper. Res., 2010

2008
An efficient generalized network-simplex-based algorithm for manufacturing network flows.
J. Comb. Optim., 2008

2007
A new lower bound for the linear knapsack problem with general integer variables.
Eur. J. Oper. Res., 2007


  Loading...