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

46 citations · 54 across the 6 of their papers we have counts for

collaborators

7 papers

math.OC2024★ 1 cited

Constructing Tight Quadratic Relaxations for Global Optimization: II. Underestimating Difference-of-Convex (D.C.) Functions

William R. Strahl, Arvind U. Raghunathan, Nikolaos V. Sahinidis +1

Recent advances in the efficiency and robustness of algorithms solving convex quadratically constrained quadratic programming (QCQP) problems motivate developing techniques for cre…

math.OC2024★ 1 cited

Constructing Tight Quadratic Relaxations for Global Optimization: I. Outer-Approximating Twice-Differentiable Convex Functions

William R. Strahl, Arvind U. Raghunathan, Nikolaos V. Sahinidis +1

When computing bounds, spatial branch-and-bound algorithms often linearly outer approximate convex relaxations for non-convex expressions in order to capitalize on the efficiency a…

math.OC2023

A Novel Mixed-Integer Linear Programming Formulation for Continuous-Time Inventory Routing

Akang Wang, Xiandong Li, Jeffrey E. Arbogast +2

Inventory management, vehicle routing, and delivery scheduling decisions are simultaneously considered in the context of the inventory routing problem. This paper focuses on the co…

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…

math.OC2015★ 5 cited

Designing Networks: A Mixed-Integer Linear Optimization Approach

Chrysanthos E. Gounaris, Karthikeyan Rajendran, Ioannis G. Kevrekidis +1

Designing networks with specified collective properties is useful in a variety of application areas, enabling the study of how given properties affect the behavior of network model…