default search action
S. Raghavan 0001
Person information
- affiliation: University of Maryland, School of Business, College Park, MD, USA
- affiliation (PhD 1995): Massachusetts Institute of Technology, Cambridge, MA, USA
Other persons with the same name
- S. Raghavan — disambiguation page
- S. Raghavan 0002 — National Institute of Technology, Trichy, Tiruchirappalli, India
- S. Raghavan 0003
— National Institute of Technology Karnataka, Surathkal, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j47]S. Raghavan
The Driver-Aide Problem: Coordinated Logistics for Last-Mile Delivery. Manuf. Serv. Oper. Manag. 26(1): 291-311 (2024) - 2023
- [j46]Shubham Akshat
Improving Broader Sharing to Address Geographic Inequity in Liver Transplantation. Manuf. Serv. Oper. Manag. 25(4): 1509-1526 (2023) - [j45]Bruce L. Golden, Eric Oden
The rendezvous vehicle routing problem. Optim. Lett. 17(8): 1711-1738 (2023) - 2022
- [j44]S. Raghavan
Influence Maximization with Latency Requirements on Social Networks. INFORMS J. Comput. 34(2): 710-728 (2022) - [j43]S. Raghavan
Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem. INFORMS J. Comput. 34(3): 1345-1365 (2022) - 2021
- [j42]S. Raghavan, J. Cole Smith:
Preface. Networks 77(1): 3-4 (2021) - [j41]S. Raghavan
Preface. Networks 77(2): 175-176 (2021) - [j40]S. Raghavan
Weighted target set selection on trees and cycles. Networks 77(4): 587-609 (2021) - 2020
- [j39]Dilek Günneç
Least-Cost Influence Maximization on Social Networks. INFORMS J. Comput. 32(2): 289-302 (2020) - [j38]Dilek Günneç
A branch-and-cut approach for the least cost influence problem on social networks. Networks 76(1): 84-105 (2020)
2010 – 2019
- 2019
- [j37]S. Raghavan
The capacitated mobile facility location problem. Eur. J. Oper. Res. 277(2): 507-520 (2019) - [j36]S. Raghavan
A Branch-and-Cut Approach for the Weighted Target Set Selection Problem on Social Networks. INFORMS J. Optim. 1(4): 304-322 (2019) - 2017
- [j35]Dilek Günneç, S. Raghavan
Integrating Social Network Effects in the Share-Of-Choice Problem. Decis. Sci. 48(6): 1098-1131 (2017) - [j34]M. Gisela Bardossy, S. Raghavan
An inexact sample average approximation approach for the stochastic connected facility location problem. Networks 70(1): 19-33 (2017) - 2016
- [j33]M. Gisela Bardossy, S. Raghavan
Approximate robust optimization for the Connected Facility Location problem. Discret. Appl. Math. 210: 246-260 (2016) - 2015
- [j32]Russell D. Halper, S. Raghavan
Local search heuristics for the mobile facility location problem. Comput. Oper. Res. 62: 210-223 (2015) - [j31]Eduardo Álvarez-Miranda
The Recoverable Robust Two-Level Network Design Problem. INFORMS J. Comput. 27(1): 1-19 (2015) - [j30]Si Chen, Ivana Ljubic
The Generalized Regenerator Location Problem. INFORMS J. Comput. 27(2): 204-220 (2015) - [j29]S. Raghavan
Efficient Edge-swapping heuristics for the reload cost spanning tree problem. Networks 65(4): 380-394 (2015) - 2014
- [c1]Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, S. Raghavan, Anshul Sawant, Morteza Zadimoghaddam:
How to influence people with partial incentives. WWW 2014: 937-948 - [i2]Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, S. Raghavan, Anshul Sawant, Morteza Zadimoghaddam:
How to Influence People with Partial Incentives. CoRR abs/1401.7970 (2014) - 2013
- [j28]M. Gisela Bardossy, S. Raghavan:
Robust Optimization for the Connected Facility Location Problem. Electron. Notes Discret. Math. 44: 149-154 (2013) - [j27]S. Raghavan, Daliborka Stanojevic:
Designing WDM Optical Networks Using Branch-and-Price. J. Math. Model. Algorithms Oper. Res. 12(4): 407-428 (2013) - 2012
- [j26]Ioannis Gamvros, S. Raghavan:
Multi-period traffic routing in satellite networks. Eur. J. Oper. Res. 219(3): 738-750 (2012) - [j25]Bruce L. Golden, Zahra Naji Azimi
The Generalized Covering Salesman Problem. INFORMS J. Comput. 24(4): 534-553 (2012) - [j24]Ioannis Gamvros, Luis Eduardo Neves Gouveia
Reload cost trees and network design. Networks 59(4): 365-379 (2012) - 2011
- [j23]S. Raghavan, Daliborka Stanojevic:
Branch and Price for WDM Optical Networks with No Bifurcation of Flow. INFORMS J. Comput. 23(1): 56-74 (2011) - [j22]Russell D. Halper, S. Raghavan:
The Mobile Facility Routing Problem. Transp. Sci. 45(3): 413-434 (2011) - 2010
- [j21]Zahra Naji Azimi
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems. Comput. Oper. Res. 37(11): 1952-1964 (2010) - [j20]M. Gisela Bardossy, S. Raghavan:
Dual-Based Local Search for the Connected Facility Location and Related Problems. INFORMS J. Comput. 22(4): 584-602 (2010) - [j19]Si Chen, Ivana Ljubic
The regenerator location problem. Networks 55(3): 205-220 (2010)
2000 – 2009
- 2009
- [j18]Robert W. Day, S. Raghavan:
Matrix Bidding in Combinatorial Auctions. Oper. Res. 57(4): 916-933 (2009) - 2008
- [j17]Robert W. Day, S. Raghavan:
A combinatorial procurement auction featuring bundle price revelation without free-riding. Decis. Support Syst. 44(3): 621-640 (2008) - [j16]Bruce L. Golden, S. Raghavan, Daliborka Stanojevic:
The prize-collecting generalized minimum spanning tree problem. J. Heuristics 14(1): 69-93 (2008) - 2007
- [j15]Robert W. Day, S. Raghavan:
Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions. Manag. Sci. 53(9): 1389-1406 (2007) - [j14]Robert W. Day, S. Raghavan:
Computing core payments in combinatorial auctions. SIGecom Exch. 7(1): 22-24 (2007) - 2006
- [j13]Roselyn Abbiw-Jackson, Bruce L. Golden, S. Raghavan, Edward A. Wasil:
A divide-and-conquer local search heuristic for data visualization. Comput. Oper. Res. 33(11): 3070-3087 (2006) - [j12]Zhiwei Fu, Bruce L. Golden, Shreevardhan Lele, S. Raghavan, Edward A. Wasil:
Diversification for better classification trees. Comput. Oper. Res. 33(11): 3185-3202 (2006) - [j11]Ioannis Gamvros, Bruce L. Golden, S. Raghavan:
The Multilevel Capacitated Minimum Spanning Tree Problem. INFORMS J. Comput. 18(3): 348-365 (2006) - [j10]Ioannis Gamvros, Richard Nidel, S. Raghavan:
Investment Analysis and Budget Allocation at Catholic Relief Services. Interfaces 36(5): 400-406 (2006) - 2005
- [j9]Bruce L. Golden, S. Raghavan, Daliborka Stanojevic:
Heuristic Search for the Generalized Minimum Spanning Tree Problem. INFORMS J. Comput. 17(3): 290-304 (2005) - [j8]G. Anandalingam, S. Raghavan:
Introduction to the Special Issue on Electronic Markets. Manag. Sci. 51(3): 315 (2005) - [j7]G. Anandalingam, Robert W. Day, S. Raghavan:
The Landscape of Electronic Market Design. Manag. Sci. 51(3): 316-327 (2005) - [j6]Thomas L. Magnanti, S. Raghavan:
Strong formulations for network design problems with connectivity requirements. Networks 45(2): 61-79 (2005) - [i1]Robert W. Day, S. Raghavan:
Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions. Computing and Markets 2005 - 2004
- [j5]Rosemary T. Berger, S. Raghavan:
Long-Distance Access Network Design. Manag. Sci. 50(3): 309-325 (2004) - [j4]S. Raghavan:
Low-connectivity network design on series-parallel graphs. Networks 43(3): 163-176 (2004) - 2003
- [j3]Zhiwei Fu, Bruce L. Golden, Shreevardhan Lele, S. Raghavan, Edward A. Wasil:
A Genetic Algorithm-Based Approach for Building Accurate Decision Trees. INFORMS J. Comput. 15(1): 3-22 (2003) - [j2]Zhiwei Fu, Bruce L. Golden, Shreevardhan Lele, S. Raghavan, Edward A. Wasil:
Genetically Engineered Decision Trees: Population Diversity Produces Smarter Trees. Oper. Res. 51(6): 894-907 (2003) - 2002
- [j1]Edward M. Condon, Bruce L. Golden, Shreevardhan Lele, S. Raghavan, Edward A. Wasil:
A visualization model based on adjacency data. Decis. Support Syst. 33(4): 349-362 (2002)
1990 – 1999
- 1995
- [b1]S. Raghavan:
Formulations and algorithms for network design problems with connectivity requirements. Massachusetts Institute of Technology, Cambridge, MA, USA, 1995
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-04-25 05:43 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: