Domination Between Traffic Matrices

DOI10.1287/moor.1070.0280zbMath1161.90514OpenAlexW2118479442MaRDI QIDQ5388072

Gianpaolo Oriolo

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

zbMATH Keywords

robust optimizationnetwork designmulticommodity flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Combinatorial optimization (90C27)

Related Items

The robust network loading problem with dynamic routing ⋮ New discoveries of domination between traffic matrices ⋮ 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 ⋮ A note on capacity models for network design ⋮ Static and dynamic routing under disjoint dominant extreme demands ⋮ On total traffic domination in non-complete graphs ⋮ Network design with a discrete set of traffic matrices