On total traffic domination in non-complete graphs

DOI10.1016/j.orl.2010.11.007zbMath1207.90031OpenAlexW2091873264MaRDI QIDQ631212

Pablo Pavón Mariño, Michał Pióro

Publication date: 22 March 2011

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

Full work available at URL: https://doi.org/10.1016/j.orl.2010.11.007

zbMATH Keywords

network optimizationmulti-hour optimizationtraffic matrices domination

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Cites Work

• Routing of uncertain traffic demands
• Hardness of robust network design
• Domination Between Traffic Matrices

This page was built for publication: On total traffic domination in non-complete graphs