Scenario recourse inequalities allow exact formulation of VRPSDs under scenario-optimal recourse policies and solve 329 more instances to optimality than previous state-of-the-art ILS algorithms.
Robust discrete optimization and network flows
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 2roles
background 1polarities
background 1representative citing papers
A target-based DRO model for MST under distributional uncertainty is solved exactly via Benders decomposition and a modified Prim algorithm.
citing papers explorer
-
On vehicle routing problems with stochastic demands -- Scenario-optimal recourse policies
Scenario recourse inequalities allow exact formulation of VRPSDs under scenario-optimal recourse policies and solve 329 more instances to optimality than previous state-of-the-art ILS algorithms.
-
Target-based Distributionally Robust Minimum Spanning Tree Problem
A target-based DRO model for MST under distributional uncertainty is solved exactly via Benders decomposition and a modified Prim algorithm.