Pages that link to "Item:Q1197996"
From MaRDI portal
The following pages link to An approximation algorithm for the general routing problem (Q1197996):
Displaying 19 items.
- A simple routing algorithm based on Schnyder coordinates (Q391094) (← links)
- The generalized packet routing problem (Q580964) (← links)
- Algorithms for generalized round robin routing (Q1195874) (← links)
- New inequalities for the general routing problem (Q1278493) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Research on routing algorithm based on limitation arrangement principle in mathematics (Q1718627) (← links)
- Approximation algorithms for general cluster routing problem (Q2019492) (← links)
- Approximation algorithms with constant ratio for general cluster routing problems (Q2084625) (← links)
- Approximation algorithms for some extensions of the maximum profit routing problem (Q2105889) (← links)
- On the general routing polytope (Q2473035) (← links)
- On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
- An algorithm for the solution of the two-route Johnson problem (Q3033545) (← links)
- A Decade of Capacitated Arc Routing (Q3564348) (← links)
- (Q3680603) (← links)
- (Q3793917) (← links)
- A $1.6$ Approximation Algorithm for Routing Multiterminal Nets (Q3801063) (← links)
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
- A cutting plane algorithm for the general routing problem (Q5935711) (← links)
- Improving a constructive heuristic for the general routing problem (Q6179705) (← links)