Showing math.OCShow all
3 papers · 1 filter
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.OC2018
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
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…