Pages that link to "Item:Q3593366"
From MaRDI portal
The following pages link to Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths (Q3593366):
Displayed 9 items.
- An integer programming algorithm for routing optimization in IP networks (Q547285) (← links)
- Inverse optimization problems with multiple weight functions (Q2112661) (← links)
- Approximability of unsplittable shortest path routing problems (Q3057101) (← links)
- Optimization of OSPF Routing in IP Networks (Q3404471) (← links)
- An Integer Programming Algorithm for Routing Optimization in IP Networks (Q3541087) (← links)
- (Q5009558) (← 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)