Pages that link to "Item:Q953301"
From MaRDI portal
The following pages link to Approximation algorithms for a vehicle routing problem (Q953301):
Displaying 15 items.
- The \(k\)-dissimilar vehicle routing problem (Q319301) (← links)
- A constant-factor approximation algorithm for multi-vehicle collection for processing problem (Q376011) (← links)
- Approximation results for a min-max location-routing problem (Q765374) (← links)
- Minimum makespan vehicle routing problem with compatibility constraints (Q2011596) (← links)
- The EMS vehicle patient transportation problem during a demand surge (Q2022301) (← links)
- Approximation algorithms for some extensions of the maximum profit routing problem (Q2105889) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- Variants and formulations of the vehicle routing problem (Q2325248) (← links)
- Vehicle Routing Algorithms for Radially Escaping Targets (Q2949981) (← links)
- Approximation Algorithms for Conflict-Free Vehicle Routing (Q3092267) (← links)
- (Q3313626) (← links)
- (Q3690603) (← links)
- (Q3751354) (← links)
- Approximations for minimum and min-max vehicle routing problems (Q5491457) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5925635) (← links)