Pages that link to "Item:Q3057101"
From MaRDI portal
The following pages link to Approximability of unsplittable shortest path routing problems (Q3057101):
Displaying 11 items.
- On the union of intermediate nodes of shortest paths (Q358654) (← links)
- An integer programming algorithm for routing optimization in IP networks (Q547285) (← links)
- A multi-start variable neighborhood search for solving the single path multicommodity flow problem (Q902982) (← links)
- Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs (Q1613354) (← links)
- The subdivision-constrained routing requests problem (Q2436672) (← links)
- Optimization of OSPF Routing in IP Networks (Q3404471) (← links)
- An Integer Programming Algorithm for Routing Optimization in IP Networks (Q3541087) (← links)
- New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures (Q3833887) (← links)
- Polylog-time and near-linear work approximation scheme for undirected shortest paths (Q4406310) (← links)
- Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem (Q6070981) (← links)
- An enhanced Benders decomposition method for unique shortest path routing (Q6613945) (← links)