An efficient approach to optimization of semi‐stable routing in multicommodity flow networks

DOI10.1002/net.21999zbMath1528.90065OpenAlexW3102774019MaRDI QIDQ6087135

Michał Pióro, Unnamed Author, Artur Tomaszewski, I. Filippini, Antonio Capone

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

integer programmingmulticommodity flowssoftware defined networkssemi-stable routingtime-dependent traffic

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18)

Cites Work

• Complexity of column generation in network design with path-based survivability mechanisms
• Robust routing and optimal partitioning of a traffic demand polytope
• Solving the bifurcated and nonbifurcated robust network loading problem with k‐adaptive routing
• Affine recourse for the robust network design problem: Between static and dynamic routing
• Optimal oblivious routing in polynomial time
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient approach to optimization of semi‐stable routing in multicommodity flow networks