Anirudh Subramanyam

According to our database, Anirudh Subramanyam authored at least 10 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Electric vehicle supply equipment location and capacity allocation for fixed-route networks.

Amir Davatgari, Taner Cokyasar, Anirudh Subramanyam, Jeffrey Larson, Abolfazl (Kouros) Mohammadian

Eur. J. Oper. Res., 2024

2023

Network Cascade Vulnerability using Constrained Bayesian Optimization.

Albert Lam, Mihai Anitescu, Anirudh Subramanyam

CoRR, 2023

2022

Optimization under Rare Chance Constraints.

Shanyin Tong, Anirudh Subramanyam, Vishwas Rao

SIAM J. Optim., 2022

Frequency Recovery in Power Grids using High-Performance Computing.

Vishwas Rao, Anirudh Subramanyam, Michel Schanen, Youngdae Kim, Ignas Satkauskas, Mihai Anitescu

Proceedings of the Workshop Proceedings of the 51st International Conference on Parallel Processing, 2022

2021

Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty.

Anirudh Subramanyam, Frank Mufalli, José M. Laínez-Aguirre, José Mauricio Pinto, Chrysanthos E. Gounaris

Oper. Res., 2021

2020

<i>K</i>-adaptability in two-stage mixed-integer robust optimization.

Anirudh Subramanyam, Chrysanthos E. Gounaris, Wolfram Wiesemann

Math. Program. Comput., 2020

Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty.

Anirudh Subramanyam, Panagiotis P. Repoussis, Chrysanthos E. Gounaris

INFORMS J. Comput., 2020

2018

A Decomposition Algorithm for the Consistent Traveling Salesman Problem with Vehicle Idling.

Anirudh Subramanyam, Chrysanthos E. Gounaris

Transp. Sci., 2018

A Scenario Decomposition Algorithm for Strategic Time Window Assignment Vehicle Routing Problems.

Anirudh Subramanyam, Akang Wang, Chrysanthos E. Gounaris

CoRR, 2018

2016

A branch-and-cut framework for the consistent traveling salesman problem.

Anirudh Subramanyam, Chrysanthos E. Gounaris

Eur. J. Oper. Res., 2016