Static and dynamic routing under disjoint dominant extreme demands

DOI10.1016/j.orl.2010.11.009zbMath1207.90020OpenAlexW2029112512WikidataQ118165469 ScholiaQ118165469MaRDI QIDQ631210

F. Pascali, Antonio Frangioni, Maria Grazia Scutellà

Publication date: 22 March 2011

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11568/189508

zbMATH Keywords

robust optimizationnetwork designHose model

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (2)

Affine recourse for the robust network design problem: Between static and dynamic routing ⋮ On the approximability of robust network design

Cites Work

• Unnamed Item
• Dynamic vs. oblivious routing in network design
• Routing of uncertain traffic demands
• On improving optimal oblivious routing
• The ellipsoid method and its consequences in combinatorial optimization
• Hardness of robust network design
• Designing Least-Cost Nonblocking Broadband Networks
• Provisioning a virtual private network
• Domination Between Traffic Matrices
• Integrality Ratio for Group Steiner Trees and Directed Steiner Trees
• Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks

This page was built for publication: Static and dynamic routing under disjoint dominant extreme demands