Pages that link to "Item:Q833579"

The following pages link to On improving optimal oblivious routing (Q833579):

Displaying 20 items.

• A comparison of routing sets for robust network design (Q479214) (← links)
• Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE (Q547138) (← links)
• Static and dynamic routing under disjoint dominant extreme demands (Q631210) (← links)
• Dynamic vs. oblivious routing in network design (Q634684) (← links)
• Optimal oblivious routing under linear and ellipsoidal uncertainty (Q1039914) (← links)
• Oblivious routing with limited buffer capacity (Q1176105) (← links)
• Network design in scarce data environment using moment-based distributionally robust optimization (Q1651520) (← links)
• A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← links)
• A note on hierarchical hubbing for a generalization of the VPN problem (Q1785741) (← links)
• On the approximability of robust network design (Q1998836) (← links)
• Augmenting predictive with oblivious routing for wireless mesh networks under traffic uncertainty (Q2270083) (← links)
• A Time-Randomness Trade-Off for Oblivious Routing (Q3468611) (← links)
• (Q5091130) (← links)
• Randomized Throughput-Optimal Oblivious Routing for Torus Networks (Q5274337) (← 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)
• Optimal oblivious routing in polynomial time (Q5901088) (← links)
• Affine routing for robust network design (Q6065910) (← links)
• Optimal oblivious reconfigurable networks (Q6083590) (← links)
• Moment-based distributionally robust joint chance constrained optimization for service network design under demand uncertainty (Q6640180) (← links)