On total traffic domination in non-complete graphs

DOI10.1016/J.ORL.2010.11.007MaRDI QIDQ631212zbMATH OpenOpenAlexFDO

Authors 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

multi-hour optimizationnetwork optimizationtraffic matrices domination

Mathematics Subject Classification ID

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

Recommendations

• Domination Between Traffic Matrices
• New discoveries of domination between traffic matrices
• scientific article; zbMATH DE number 139926
• Total domination in interval graphs
• scientific article; zbMATH DE number 861318

Cites work

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

Cited in

(2)

• New discoveries of domination between traffic matrices
• Domination Between Traffic Matrices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631212)