Pages that link to "Item:Q5388072"

The following pages link to Domination Between Traffic Matrices (Q5388072):

Displaying 9 items.

• OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694) (← links)
• Static and dynamic routing under disjoint dominant extreme demands (Q631210) (← links)
• On total traffic domination in non-complete graphs (Q631212) (← links)
• The robust network loading problem with dynamic routing (Q2377165) (← links)
• New discoveries of domination between traffic matrices (Q2401765) (← links)
• A note on capacity models for network design (Q2417179) (← links)
• Network design with a discrete set of traffic matrices (Q2450673) (← links)
• Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
• Affine recourse for the robust network design problem: Between static and dynamic routing (Q5326787) (← links)