Approximation algorithms for a vehicle routing problem
From MaRDI portal
Publication:953301
Recommendations
Cites work
Cited in
(14)- scientific article; zbMATH DE number 3914108 (Why is no real title available?)
- An approximation algorithm for vehicle routing with compatibility constraints
- Vehicle Routing Algorithms for Radially Escaping Targets
- Approximations for minimum and min-max vehicle routing problems
- Approximation results for a min-max location-routing problem
- Variants and formulations of the vehicle routing problem
- Minimum makespan vehicle routing problem with compatibility constraints
- Improving the approximation ratio for capacitated vehicle routing
- The EMS vehicle patient transportation problem during a demand surge
- The \(k\)-dissimilar vehicle routing problem
- Approximation algorithms for some extensions of the maximum profit routing problem
- scientific article; zbMATH DE number 3989085 (Why is no real title available?)
- scientific article; zbMATH DE number 3843499 (Why is no real title available?)
- Approximation Algorithms for Conflict-Free Vehicle Routing
This page was built for publication: Approximation algorithms for a vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953301)