Exact Computational Approaches to a Stochastic Uncapacitated. Single Allocation p-Hub Center Problem

-hub center problem is an extension of the deterministicversion which aims to minimize the longest origin-destination path in a hub and spokenetwork. Considering the stochastic nature of travel times on links is important when designing anetwork to guarantee the quality of service measured by a maximum delivery time for a proportionof all deliveries. We propose an efficient reformulation for a stochastic p-hub center problem anddevelop exact solution approaches based on cutting planes and Benders’ decomposition...