Formulations and algorithms for network design problems with connectivity requirements. - S. Raghavan 001 (1995)

A visualization model based on adjacency data. - Edward M. Condon; Bruce L. Golden; Shreevardhan Lele; S. Raghavan 001; Edward A. Wasil (Decis. Support Syst., 2002)

A Genetic Algorithm-Based Approach for Building Accurate Decision Trees. - Zhiwei Fu; Bruce L. Golden; Shreevardhan Lele; S. Raghavan 001; Edward A. Wasil (INFORMS J. Comput., 2003)

Genetically Engineered Decision Trees: Population Diversity Produces Smarter Trees. - Zhiwei Fu; Bruce L. Golden; Shreevardhan Lele; S. Raghavan 001; Edward A. Wasil (Oper. Res., 2003)

Long-Distance Access Network Design. - Rosemary T. Berger; S. Raghavan 001 (Manag. Sci., 2004)

Low-connectivity network design on series-parallel graphs. - S. Raghavan 001 (Networks, 2004)

Heuristic Search for the Generalized Minimum Spanning Tree Problem. - Bruce L. Golden; S. Raghavan 001; Daliborka Stanojevic (INFORMS J. Comput., 2005)

The Landscape of Electronic Market Design. - G. Anandalingam; Robert W. Day; S. Raghavan 001 (Manag. Sci., 2005)

Introduction to the Special Issue on Electronic Markets. - G. Anandalingam; S. Raghavan 001 (Manag. Sci., 2005)

Strong formulations for network design problems with connectivity requirements. - Thomas L. Magnanti; S. Raghavan 001 (Networks, 2005)

A divide-and-conquer local search heuristic for data visualization. - Roselyn Abbiw-Jackson; Bruce L. Golden; S. Raghavan 001; Edward A. Wasil (Comput. Oper. Res., 2006)

Diversification for better classification trees. - Zhiwei Fu; Bruce L. Golden; Shreevardhan Lele; S. Raghavan 001; Edward A. Wasil (Comput. Oper. Res., 2006)

The Multilevel Capacitated Minimum Spanning Tree Problem. - Ioannis Gamvros; Bruce L. Golden; S. Raghavan 001 (INFORMS J. Comput., 2006)

Investment Analysis and Budget Allocation at Catholic Relief Services. - Ioannis Gamvros; Richard Nidel; S. Raghavan 001 (Interfaces, 2006)

Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions. - Robert W. Day; S. Raghavan 001 (Manag. Sci., 2007)

Computing core payments in combinatorial auctions. - Robert W. Day; S. Raghavan 001 (SIGecom Exch., 2007)

A combinatorial procurement auction featuring bundle price revelation without free-riding. - Robert W. Day; S. Raghavan 001 (Decis. Support Syst., 2008)

The prize-collecting generalized minimum spanning tree problem. - Bruce L. Golden; S. Raghavan 001; Daliborka Stanojevic (J. Heuristics, 2008)

Matrix Bidding in Combinatorial Auctions. - Robert W. Day; S. Raghavan 001 (Oper. Res., 2009)

Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems. - Zahra Naji Azimi; Majid Salari; Bruce L. Golden; S. Raghavan 001; Paolo Toth (Comput. Oper. Res., 2010)

Dual-Based Local Search for the Connected Facility Location and Related Problems. - M. Gisela Bardossy; S. Raghavan 001 (INFORMS J. Comput., 2010)

The regenerator location problem. - Si Chen; Ivana Ljubic; S. Raghavan 001 (Networks, 2010)

Branch and Price for WDM Optical Networks with No Bifurcation of Flow. - S. Raghavan 001; Daliborka Stanojevic (INFORMS J. Comput., 2011)

The Mobile Facility Routing Problem. - Russell D. Halper; S. Raghavan 001 (Transp. Sci., 2011)

Multi-period traffic routing in satellite networks. - Ioannis Gamvros; S. Raghavan 001 (Eur. J. Oper. Res., 2012)

The Generalized Covering Salesman Problem. - Bruce L. Golden; Zahra Naji Azimi; S. Raghavan 001; Majid Salari; Paolo Toth (INFORMS J. Comput., 2012)

Reload cost trees and network design. - Ioannis Gamvros; Luis Eduardo Neves Gouveia; S. Raghavan 001 (Networks, 2012)

Robust Optimization for the Connected Facility Location Problem. - M. Gisela Bardossy; S. Raghavan 001 (Electron. Notes Discret. Math., 2013)

Designing WDM Optical Networks Using Branch-and-Price. - S. Raghavan 001; Daliborka Stanojevic (J. Math. Model. Algorithms Oper. Res., 2013)

How to influence people with partial incentives. - Erik D. Demaine; MohammadTaghi Hajiaghayi; Hamid Mahini; David L. Malec; S. Raghavan 001; Anshul Sawant; Morteza Zadimoghaddam (WWW, 2014)

Local search heuristics for the mobile facility location problem. - Russell D. Halper; S. Raghavan 001; Mustafa Sahin (Comput. Oper. Res., 2015)

The Recoverable Robust Two-Level Network Design Problem. - Eduardo Álvarez-Miranda; Ivana Ljubic; S. Raghavan 001; Paolo Toth (INFORMS J. Comput., 2015)

The Generalized Regenerator Location Problem. - Si Chen; Ivana Ljubic; S. Raghavan 001 (INFORMS J. Comput., 2015)

Efficient Edge-swapping heuristics for the reload cost spanning tree problem. - S. Raghavan 001; Mustafa Sahin (Networks, 2015)

Approximate robust optimization for the Connected Facility Location problem. - M. Gisela Bardossy; S. Raghavan 001 (Discret. Appl. Math., 2016)

Integrating Social Network Effects in the Share-Of-Choice Problem. - Dilek Günneç; S. Raghavan 001 (Decis. Sci., 2017)

An inexact sample average approximation approach for the stochastic connected facility location problem. - M. Gisela Bardossy; S. Raghavan 001 (Networks, 2017)

The capacitated mobile facility location problem. - S. Raghavan 001; Mustafa Sahin; F. Sibel Salman (Eur. J. Oper. Res., 2019)

A Branch-and-Cut Approach for the Weighted Target Set Selection Problem on Social Networks. - S. Raghavan 001; Rui Zhang 025 (INFORMS J. Optim., 2019)

Least-Cost Influence Maximization on Social Networks. - Dilek Günneç; S. Raghavan 001; Rui Zhang 025 (INFORMS J. Comput., 2020)

A branch-and-cut approach for the least cost influence problem on social networks. - Dilek Günneç; S. Raghavan 001; Rui Zhang 025 (Networks, 2020)

Preface. - S. Raghavan 001; J. Cole Smith (Networks, 2021)

Weighted target set selection on trees and cycles. - S. Raghavan 001; Rui Zhang 025 (Networks, 2021)

Influence Maximization with Latency Requirements on Social Networks. - S. Raghavan 001; Rui Zhang 025 (INFORMS J. Comput., 2022)

Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem. - S. Raghavan 001; Rui Zhang 025 (INFORMS J. Comput., 2022)

Improving Broader Sharing to Address Geographic Inequity in Liver Transplantation. - Shubham Akshat; Liye Ma; S. Raghavan 001 (Manuf. Serv. Oper. Manag., 2023)

The rendezvous vehicle routing problem. - Bruce L. Golden; Eric Oden; S. Raghavan 001 (Optim. Lett., 2023)

The Driver-Aide Problem: Coordinated Logistics for Last-Mile Delivery. - S. Raghavan 001; Rui Zhang 025 (Manuf. Serv. Oper. Manag., 2024)

The urban air mobility problem. - Bruce L. Golden; Eric Oden; S. Raghavan 001 (Ann. Oper. Res., 2025)