Pages that link to "Item:Q5391869"

The following pages link to Routing and Capacity Optimization for IP Networks (Q5391869):

Displaying 8 items.

• Clique-based facets for the precedence constrained knapsack problem (Q431007) (← links)
• An integer programming algorithm for routing optimization in IP networks (Q547285) (← links)
• A strengthened formulation and cutting planes for the open pit mine production scheduling problem (Q2270449) (← links)
• Polynomial-time algorithms for special cases of the maximum confluent flow problem (Q2434729) (← links)
• Approximability of unsplittable shortest path routing problems (Q3057101) (← links)
• Optimization of OSPF Routing in IP Networks (Q3404471) (← links)
• Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty (Q4648697) (← links)
• Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems (Q5136261) (← links)