On improving optimal oblivious routing
From MaRDI portal
Publication:833579
DOI10.1016/j.orl.2009.01.009zbMath1167.90433OpenAlexW2135762023MaRDI QIDQ833579
Publication date: 14 August 2009
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2009.01.009
Related Items (9)
Network design in scarce data environment using moment-based distributionally robust optimization ⋮ Robust network design: Formulations, valid inequalities, and computations ⋮ Affine recourse for the robust network design problem: Between static and dynamic routing ⋮ Affine routing for robust network design ⋮ Static and dynamic routing under disjoint dominant extreme demands ⋮ A comparison of routing sets for robust network design ⋮ A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation ⋮ On the approximability of robust network design ⋮ Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
Cites Work
This page was built for publication: On improving optimal oblivious routing
