Skip to content
Viswanath Nagarajan site logo
  • Publications
  • Papers By Topic
    • Papers By Topic
    • Network Design
    • Vehicle Routing
    • Scheduling
    • Online Algorithms
    • Stochastic Optimization
  • Teaching
    • Teaching
    • Approximation & Online Algorithms (Fall ’24)
    • Approximation & Online Algorithms (Winter ’21)
    • Approximation Algorithms
  • Students
  • Papers By Topic
    • Papers By Topic
    • Network Design
    • Vehicle Routing
    • Scheduling
    • Online Algorithms
    • Stochastic Optimization

Vehicle Routing

  • Informative Path Planning with Limited Adaptivity, with R. Tan and R. Ghuge, AISTATS, 2024.  
  • Improving Column-Generation for Vehicle Routing Problems via Random Coloring and Parallelization,
    with M. Yu and S. Shen, INFORMS Journal on Computing, 34(2): 953-973, 2022. DOI.
  • Approximation Algorithms for the A Priori Traveling Repairman, with I.L. Goertz and F. Navidi,
    Operations Research Letters, 48(5), 599-606, 2020. DOI.
  • Adaptive Submodular Ranking and Routing, with F. Navidi and P. Kambadur,
    Operations Research, 68(3):856-877, 2020. DOI.
    Preliminary version in IPCO, 2017. DOI.
  • An Approximation Algorithm for Vehicle Routing with Compatibility Constraints, with M. Yu and S. Shen, 
    Operations Research Letters, 46(6), 579-584, 2018.
    Preliminary version in CPAIOR 2017.
  • Approximation Algorithms for Optimal Decision Trees and Adaptive TSP, with A. Gupta and R. Ravi,
    Mathematics of Operations Research, 42(3): 876-896, 2017. DOI.
    Preliminary version in ICALP 2010.
  • Approximation algorithms for stochastic k-TSP, with A. Ene and R. Saket,
    FSTTCS, 2017. DOI.
  • Approximation Algorithms for Inventory Problems with Submodular or Routing Costs, with C. Shi, 
    Mathematical Programming, 160(1-2): 225-244, 2016.
  • Capacitated Vehicle Routing with Non-Uniform Speeds, with I. L. Goertz, M. Molinaro and R. Ravi, 
    Mathematics of Operations Research, 41(1): 318-331, 2016. 
    Preliminary version in IPCO 2011
  • Minimum Latency Submodular-Cover, with S. Im and R. van der Zwaan, 
    ACM Transactions on Algorithms, 13(1), 2016. 
    Preliminary version in ICALP 2012.
  • Locating Depots for Capacitated Vehicle Routing, with I. L. Goertz, 
    Networks 68(2): 94-103, 2016. 
    Preliminary version in APPROX 2011.
  • Approximation Algorithms for Stochastic Orienteering, with A. Gupta, R. Krishnaswamy, and R. Ravi, 
    Mathematics of Operations Research, 40(1), 2015.
    Preliminary version in SODA 2012.
  • Minimum Makespan Multi-Vehicle Dial-a-Ride, with I. L. Goertz and R. Ravi,
    ACM Transactions on Algorithms 11(3):23, 2015.
    Preliminary version in ESA 2009.
  • On the Adaptivity Gap of Stochastic Orienteering, with N. Bansal, 
    Mathematical Programming, 154(1-2), 145-172, 2015. 
    Preliminary version in IPCO 2014.
  • Approximation Algorithms for Distance Constrained Vehicle Routing, with R. Ravi, Networks, 59(2), 209-214, 2012.
    Preliminary version in APPROX 2006.
  • Stochastic Vehicle Routing with Recourse, with I.L. Goertz and R. Saket, ICALP 2012.
  • Approximation Algorithms for VRP with Stochastic Demands, with A. Gupta and R. Ravi, Operations Research, 60(1), 123-127, 2012.
  • The Directed Orienteering Problem, with R. Ravi,
    Algorithmica, 60(4), 1017-1030, 2011.
    Preliminary version in APPROX 2007.
  • Dial-a-Ride from k-forest, with A. Gupta, M.T. Hajiaghayi, and R. Ravi,
    ACM Transactions on Algorithms, 6(2), 2010.
    Preliminary version in ESA 2007.
  • The Directed Minimum Latency Problem, with R. Ravi, APPROX 2008.
  • Exact Train Pathing, with A. G. Ranade, Journal of Scheduling, 11(4), 279-297, 2008. 

Viswanath Nagarajan

Michigan Engineering

1221 Beal Ave. Ann Arbor, MI 48109-2102

+1 (734) 647-7000

Contact the College

Engineering Intranet

© 2025 The Regents of the University of Michigan | Safety and Security | Acceptable Use |Privacy Policy |U-M Main

Login