Solving the bifurcated and nonbifurcated robust network loading problem with k‐adaptive routing

DOI10.1002/net.21807zbMath1397.90096OpenAlexW2916730613MaRDI QIDQ4687215

Michael Poss, Marco Silva, Nelson F. Maculan

Publication date: 11 October 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21807

zbMATH Keywords

routing scheme\(k\)-adaptabilitydynamic partitionrobust linear optimizationnetwork loading problempolyhedral uncertainty set

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (4)

Generalized hose uncertainty in single-commodity robust network design ⋮ Affine routing for robust network design ⋮ Telecommunications network design: Technology impacts and future directions ⋮ An efficient approach to optimization of semi‐stable routing in multicommodity flow networks

This page was built for publication: Solving the bifurcated and nonbifurcated robust network loading problem with k‐adaptive routing