3 papers
math.OC2024
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.OC2024
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
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…