Domination Between Traffic Matrices
From MaRDI portal
Publication:5388072
DOI10.1287/moor.1070.0280zbMath1161.90514MaRDI QIDQ5388072
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c49ea50e49eeb588405a11e84f7c7adc59bbf621
90C35: Programming involving graphs or networks
90B18: Communication networks in operations research
90C27: Combinatorial optimization
Related Items
Robust network design: Formulations, valid inequalities, and computations, Affine recourse for the robust network design problem: Between static and dynamic routing, OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty, Static and dynamic routing under disjoint dominant extreme demands, On total traffic domination in non-complete graphs, The robust network loading problem with dynamic routing, New discoveries of domination between traffic matrices, A note on capacity models for network design, Network design with a discrete set of traffic matrices