activity
20172026
most citedA Scenario Decomposition Algorithm for Strategic Time Window Assignment Vehicle Routing Problems

46 citations · 87 across the 16 of their papers we have counts for

collaborators

18 papers

math.OC2026

Computing Rare Probabilities of Voltage Collapse

Tongtong Jin, Anirudh Subramanyam, D. Adrian Maldonado

This paper introduces a framework based on Large Deviation Theory (LDT) to accurately and efficiently compute the rare probabilities of voltage collapse. We formulate the problem a…

math.OC2026

Decision-Scaled Scenario Approach for Rare Chance-Constrained Optimization

Jaeseok Choi, Anand Deo, Constantino Lagoa +1

Chance-constrained optimization is a suitable modeling framework for safety-critical applications where violating constraints is nearly unacceptable. The scenario approach is a pop…

math.OC2026

Machine Learning-Enabled Large-Scale Capacity Expansion Planning under Uncertainty

Taehyeon Kwon, Anirudh Subramanyam

Capacity expansion planning under uncertainty requires selecting a scenario count and representative operational horizon to estimate average production costs. Small choices risk un…

math.OC2025★ 1 cited

Extreme-Scale EV Charging Infrastructure Planning for Last-Mile Delivery Using High-Performance Parallel Computing

Waquar Kaleem, Taner Cokyasar, Jeffrey Larson +3

This paper addresses stochastic charger location and allocation problems under queue congestion for last-mile delivery using electric vehicles (EVs). The objective is to decide whe…

math.OC2024

Neural Embedded Mixed-Integer Optimization for Location-Routing Problems

Waquar Kaleem, Doyoung Lee, Changhyun Kwon +1

We present a framework that combines machine learning with mixed-integer optimization to solve the Capacitated Location-Routing Problem (CLRP), a classical NP-hard problem that int…

math.OC2024

Correction to: A Lagrangian dual method for two-stage robust optimization with binary uncertainties

Henri Lefebvre, Anirudh Subramanyam

We provide a correction to the sufficient conditions under which closed-form expressions for the optimal Lagrange multiplier are provided in arXiv:2112.13138 [math.OC]. We first pr…

math.OC2023★ 13 cited

Electric Vehicle Supply Equipment Location and Capacity Allocation for Fixed-Route Networks

Amir Davatgari, Taner Cokyasar, Anirudh Subramanyam +2

Electric vehicle (EV) supply equipment location and allocation (EVSELCA) problems for freight vehicles are becoming more important because of the trending electrification shift. So…

cs.SI2023

Network Cascade Vulnerability using Constrained Bayesian Optimization

Albert Lam, Mihai Anitescu, Anirudh Subramanyam

Measures of power grid vulnerability are often assessed by the amount of damage an adversary can exact on the network. However, the cascading impact of such attacks is often overlo…

math.OC2022

A Lagrangian Dual Method for Two-Stage Robust Optimization with Binary Uncertainties

Anirudh Subramanyam

This paper presents a new exact method to calculate worst-case parameter realizations in two-stage robust optimization problems with categorical or binary-valued uncertain data. Tr…

math.OC2022

Joint Routing of Conventional and Range-Extended Electric Vehicles in a Large Metropolitan Network

Anirudh Subramanyam, Taner Cokyasar, Jeffrey Larson +1

Range-extended electric vehicles combine the higher efficiency and environmental benefits of battery-powered electric motors with the longer mileage and autonomy of conventional in…

math.OC2022★ 25 cited

A Time-Constrained Capacitated Vehicle Routing Problem in Urban E-Commerce Delivery

Taner Cokyasar, Anirudh Subramanyam, Jeffrey Larson +2

Electric vehicle routing problems can be particularly complex when recharging must be performed mid-route. In some applications such as the e-commerce parcel delivery truck routing…

math.OC2021★ 1 cited

A Globally Convergent Distributed Jacobi Scheme for Block-Structured Nonconvex Constrained Optimization Problems

Anirudh Subramanyam, Youngdae Kim, Michel Schanen +2

Motivated by the increasing availability of high-performance parallel computing, we design a distributed parallel algorithm for linearly-coupled block-structured nonconvex constrai…

math.OC2020

Optimization under rare chance constraints

Shanyin Tong, Anirudh Subramanyam, Vishwas Rao

Chance constraints provide a principled framework to mitigate the risk of high-impact extreme events by modifying the controllable properties of a system. The low probability and r…

math.OC2020

Failure Probability Constrained AC Optimal Power Flow

Anirudh Subramanyam, Jacob Roth, Albert Lam +1

Despite cascading failures being the central cause of blackouts in power transmission systems, existing operational and planning decisions are made largely by ignoring their underl…

math.OC2020

Data-driven two-stage conic optimization with zero-one uncertainties

Anirudh Subramanyam, Mohamed El Tonbari, Kibaek Kim

We address high-dimensional zero-one random parameters in two-stage convex conic optimization problems. Such parameters typically represent failures of network elements and constit…

math.OC2018★ 1 cited

Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty

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

This paper studies robust variants of an extended model of the classical Heterogeneous Vehicle Routing Problem (HVRP), where a mixed fleet of vehicles with different capacities, av…

math.OC2018★ 46 cited

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

Anirudh Subramanyam, Akang Wang, Chrysanthos E. Gounaris

We study the strategic decision-making problem of assigning time windows to customers in the context of vehicle routing applications that are affected by operational uncertainty. T…

math.OC2017

K-Adaptability in Two-Stage Mixed-Integer Robust Optimization

Anirudh Subramanyam, Chrysanthos E. Gounaris, Wolfram Wiesemann

We study two-stage robust optimization problems with mixed discrete-continuous decisions in both stages. Despite their broad range of applications, these problems pose two fundamen…