Pages that link to "Item:Q1765372"
From MaRDI portal
The following pages link to Approximation algorithms for some vehicle routing problems (Q1765372):
Displaying 21 items.
- Differential approximation algorithm of FSMVRP (Q277103) (← links)
- The \(k\)-dissimilar vehicle routing problem (Q319301) (← links)
- Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- A parameterized perspective on packing paths of length two (Q849135) (← links)
- An approximation algorithm for the pickup and delivery vehicle routing problem on trees (Q860395) (← links)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- Approximation algorithms for a vehicle routing problem (Q953301) (← links)
- New differential approximation algorithm for \(k\)-customer vehicle routing problem (Q976133) (← links)
- Linear time approximation schemes for vehicle scheduling problems (Q1887080) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- Approximation algorithms for some extensions of the maximum profit routing problem (Q2105889) (← links)
- Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity (Q2156303) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- Packing paths: recycling saves time (Q2446295) (← links)
- Approximation algorithms for distance constrained vehicle routing problems (Q2892157) (← links)
- Vehicle Routing Algorithms for Radially Escaping Targets (Q2949981) (← links)
- Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
- Approximation Algorithms for Conflict-Free Vehicle Routing (Q3092267) (← links)
- On the Distance Constrained Vehicle Routing Problem (Q4022935) (← links)
- Approximations for minimum and min-max vehicle routing problems (Q5491457) (← links)