Single‐commodity network design with random edge capacities

This paper examines the single‐commodity network design problem with stochastic edge capacities. We characterize the structures of the optimal designs and compare with the deterministic counterparts. We do this partly to understand what constitutes robust network designs, but also to construct a heuristic for the stochastic problem, leading to optimality gaps of about 10%. In our view, that is a rather good result for problems that otherwise cannot be solved at all.