Pages that link to "Item:Q4446916"

The following pages link to Optimization of Internet Protocol network design and routing (Q4446916):

Displaying 14 items.

• A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (Q342561) (← links)
• OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694) (← links)
• An integer programming algorithm for routing optimization in IP networks (Q547285) (← links)
• Optimization models for forest road upgrade planning (Q2369960) (← links)
• Multiobjective design of survivable IP networks (Q2379874) (← links)
• Approximability of unsplittable shortest path routing problems (Q3057101) (← links)
• A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion (Q3087853) (← links)
• Optimization of OSPF Routing in IP Networks (Q3404471) (← links)
• An Integer Programming Algorithm for Routing Optimization in IP Networks (Q3541087) (← links)
• Valid cycles: A source of infeasibility in open shortest path first routing (Q3548721) (← links)
• On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem (Q5191123) (← links)
• Routing and Capacity Optimization for IP Networks (Q5391869) (← links)
• Intra-domain traffic engineering with shortest path routing protocols (Q5900973) (← links)
• Intra-domain traffic engineering with shortest path routing protocols (Q5919993) (← links)