New discoveries of domination between traffic matrices

DOI10.1007/S10255-017-0636-7MaRDI QIDQ2401765zbMATH OpenOpenAlexFDO

Authors Wenguo Yang, Tiande Guo, Pengfei Liu

Publication date 5 September 2017

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10255-017-0636-7

zbMATH Keywords

dominationrobust network designmulti-commodity flows

Mathematics Subject Classification ID

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

Recommendations

• Domination Between Traffic Matrices
• On total traffic domination in non-complete graphs
• Multi-hour network planning based on domination between sets of traffic matrices
• scientific article; zbMATH DE number 1029233
• scientific article; zbMATH DE number 139926

Cites work

• scientific article; zbMATH DE number 3354799 (Why is no real title available?)
• Designing Least-Cost Nonblocking Broadband Networks
• Domination Between Traffic Matrices
• Hardness of robust network design
• Provisioning a virtual private network: a network design problem for multicommodity flow
• Robust discrete optimization and network flows
• Routing of uncertain traffic demands

Cited in

(4)

• Multi-hour network planning based on domination between sets of traffic matrices
• On total traffic domination in non-complete graphs
• On a flow-related domination problem
• Domination Between Traffic Matrices

This page was built for publication: New discoveries of domination between traffic matrices

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