Pages that link to "Item:Q2957510"
From MaRDI portal
The following pages link to \(k\)-delivery traveling salesman problem on tree networks (Q2957510):
Displaying 7 items.
- The delivery man problem on a tree network (Q920033) (← links)
- Polynomially solvable cases of the bipartite traveling salesman problem (Q1752819) (← links)
- Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree (Q2509522) (← links)
- Algorithms for capacitated vehicle routing (Q2784475) (← links)
- Approximating Capacitated Routing and Delivery Problems (Q4268861) (← links)
- Restricted delivery problems on a network (Q4347274) (← links)
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries (Q4700651) (← links)