New discoveries of domination between traffic matrices

DOI10.1007/S10255-017-0636-7zbMATH Open1370.90042OpenAlexW2186855253MaRDI QIDQ2401765FDOQ2401765

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

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

zbMATH Keywords

dominationrobust network designmulti-commodity flows

Mathematics Subject Classification ID

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

Cites Work

• Robust discrete optimization and network flows
• Hardness of robust network design
• Designing Least-Cost Nonblocking Broadband Networks
• Routing of uncertain traffic demands
• Provisioning a virtual private network: a network design problem for multicommodity flow
• Title not available (Why is that?)
• Domination Between Traffic Matrices

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)