C&O Reading Group - Matheus Ota
Title: Hardness of pricing routes for two-stage stochastic vehicle routing problems with scenarios
Speaker: | Matheus Ota |
Affiliation: | University of Waterloo |
Location: | MC 6029 |
Abstract: Following state-of-the-art exact algorithms for vehicle routing problems, several recent exact algorithms for the two-stage vehicle routing problem with stochastic demands (VRPSD) are based on set partitioning formulations. To solve the corresponding LP relaxation, these algorithms rely on efficient routines for solving the associated pricing problems. In this paper, we study the complexity of solving such VRPSD pricing problems.