On improving optimal oblivious routing

In this paper a generalization of the robust network design problem with oblivious routing is investigated, where the (uncertain) demands are served through two alternative routing templates. A mathematical programming model leading to tractable cases is presented, together with related algorithmic approaches. The proposed special cases strictly generalize the standard oblivious routing model.