default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrahalad Venkateshan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Vishal Bansal
, Arnab Bisi, Debjit Roy, Prahalad Venkateshan:
Integrated inventory replenishment and online demand allocation decisions for an omnichannel retailer with ship-from-store strategy. Eur. J. Oper. Res. 316(3): 1085-1100 (2024)- [j16]Arulanantha P. P. Maruthasalam, Debjit Roy, Prahalad Venkateshan:
Modelling driver's reactive strategies in e-hailing platforms: an agent-based simulation model and an approximate analytical model. Int. J. Prod. Res. 62(8): 2963-2981 (2024) - 2023
- [j15]Joseph G. Szmerekovsky, Prahalad Venkateshan, Peter D. Simonson:
Project scheduling under the threat of catastrophic disruption. Eur. J. Oper. Res. 309(2): 784-794 (2023) - 2022
- [j14]Yogesh Kumar Agarwal, Prahalad Venkateshan:
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries. Networks 79(4): 537-556 (2022) - 2020
- [j13]Prahalad Venkateshan, Joseph G. Szmerekovsky, George L. Vairaktarakis:
A cutting plane approach for the multi-machine precedence-constrained scheduling problem. Ann. Oper. Res. 285(1): 247-271 (2020) - [j12]Yogesh Kumar Agarwal, Prahalad Venkateshan:
A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries. Oper. Res. Lett. 48(1): 48-54 (2020) - [j11]Prahalad Venkateshan:
A Note on "The Facility Location Problem with Limited Distances". Transp. Sci. 54(6): 1439-1445 (2020)
2010 – 2019
- 2019
- [j10]Yogesh Kumar Agarwal, Prahalad Venkateshan:
New Valid Inequalities for the Optimal Communication Spanning Tree Problem. INFORMS J. Comput. 31(2): 268-284 (2019) - 2017
- [j9]Prahalad Venkateshan, Ronald H. Ballou, Kamlesh Mathur, Arulanantha P. P. Maruthasalam:
A Two-echelon joint continuous-discrete location model. Eur. J. Oper. Res. 262(3): 1028-1039 (2017) - 2016
- [j8]Yogesh Kumar Agarwal, Prahalad Venkateshan:
Near optimal design of wavelength routed optical networks. Eur. J. Oper. Res. 250(3): 990-1000 (2016) - 2015
- [j7]Prahalad Venkateshan, Kamlesh Mathur:
A Heuristic for the Multisource Weber Problem with Service Level Constraints. Transp. Sci. 49(3): 472-483 (2015) - 2014
- [j6]Yogesh Kumar Agarwal, Prahalad Venkateshan:
Survivable network design with shared-protection routing. Eur. J. Oper. Res. 238(3): 836-845 (2014) - 2012
- [j5]Joseph G. Szmerekovsky, Prahalad Venkateshan:
An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs. Comput. Oper. Res. 39(7): 1402-1410 (2012) - 2011
- [j4]Prahalad Venkateshan, Kamlesh Mathur:
An efficient column-generation-based algorithm for solving a pickup-and-delivery problem. Comput. Oper. Res. 38(12): 1647-1655 (2011) - 2010
- [j3]Prahalad Venkateshan, Kamlesh Mathur, Ronald H. Ballou:
Locating and staffing service centers under service level constraints. Eur. J. Oper. Res. 201(1): 55-70 (2010)
2000 – 2009
- 2008
- [j2]Prahalad Venkateshan, Kamlesh Mathur, Ronald H. Ballou:
An efficient generalized network-simplex-based algorithm for manufacturing network flows. J. Comb. Optim. 15(4): 315-341 (2008) - 2007
- [j1]Kamlesh Mathur, Prahalad Venkateshan:
A new lower bound for the linear knapsack problem with general integer variables. Eur. J. Oper. Res. 178(3): 738-754 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
