Anirudh Subramanyam

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 11

Top Topics

Traveling Salesman

Robust Optimization

Vehicle Routing

Top Venues

Eur. J. Oper. Res.

Publications

Amir Davatgari, Taner Cokyasar, Anirudh Subramanyam, Jeffrey Larson, Abolfazl (Kouros) Mohammadian
Electric vehicle supply equipment location and capacity allocation for fixed-route networks. Eur. J. Oper. Res. 317 (3) (2024)
Albert Lam, Mihai Anitescu, Anirudh Subramanyam
Network Cascade Vulnerability using Constrained Bayesian Optimization. CoRR (2023)
Shanyin Tong, Anirudh Subramanyam, Vishwas Rao
Optimization under Rare Chance Constraints. SIAM J. Optim. 32 (2) (2022)
Vishwas Rao, Anirudh Subramanyam, Michel Schanen, Youngdae Kim, Ignas Satkauskas, Mihai Anitescu
Frequency Recovery in Power Grids using High-Performance Computing. ICPP Workshops (2022)
Anirudh Subramanyam, Frank Mufalli, José M. Laínez-Aguirre, José Mauricio Pinto, Chrysanthos E. Gounaris
Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty. Oper. Res. 69 (1) (2021)
Anirudh Subramanyam, Chrysanthos E. Gounaris, Wolfram Wiesemann
-adaptability in two-stage mixed-integer robust optimization. Math. Program. Comput. 12 (2) (2020)
Anirudh Subramanyam, Panagiotis P. Repoussis, Chrysanthos E. Gounaris
Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty. INFORMS J. Comput. 32 (3) (2020)
Anirudh Subramanyam, Chrysanthos E. Gounaris
A Decomposition Algorithm for the Consistent Traveling Salesman Problem with Vehicle Idling. Transp. Sci. 52 (2) (2018)
Anirudh Subramanyam, Akang Wang, Chrysanthos E. Gounaris
A Scenario Decomposition Algorithm for Strategic Time Window Assignment Vehicle Routing Problems. CoRR (2018)
Anirudh Subramanyam, Panagiotis P. Repoussis, Chrysanthos E. Gounaris
Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty. CoRR (2018)
Anirudh Subramanyam, Chrysanthos E. Gounaris
A branch-and-cut framework for the consistent traveling salesman problem. Eur. J. Oper. Res. 248 (2) (2016)