4 papers · 1 filter
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…
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…
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…
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…