Multi-hour network planning based on domination between sets of traffic matrices

DOI10.1016/J.COMNET.2010.10.013MaRDI QIDQ2431449zbMATH OpenOpenAlexFDO

Authors B. Garcia-Manrubia, R. Aparicio-Pardo, Pablo Pavón Mariño

Publication date 14 April 2011

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2010.10.013

zbMATH Keywords

multi-hour trafficnetwork planningtraffic domination

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Domination Between Traffic Matrices
• New discoveries of domination between traffic matrices
• Network design with a discrete set of traffic matrices
• A dynamic discrete network design problem for maintenance planning in traffic networks
• Simultaneous network line planning and traffic assignment
• New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks
• Models and algorithms for robust network design with several traffic scenarios
• Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks
• Generalized solutions to the vector optimization problem of traffic flow on networks

Cited in

(2)

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

This page was built for publication: Multi-hour network planning based on domination between sets of traffic matrices

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