Approximation Algorithms for Conflict-Free Vehicle Routing
From MaRDI portal
Recommendations
- Approximation algorithms for a vehicle routing problem
- Approximation algorithms for some vehicle routing problems
- Approximation algorithms for distance constrained vehicle routing problems
- An approximation algorithm for vehicle routing with compatibility constraints
- Exact algorithms for routing problems under vehicle capacity constraints
- scientific article; zbMATH DE number 3989085
- Approximations for minimum and min-max vehicle routing problems
- The vehicle routing problem: An overview of exact and approximate algorithms
- Approximation algorithms for the load-balanced capacitated vehicle routing problem
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
Cited in
(7)- Collision-free routing problem with restricted L-path
- Collision-free routing problem with restricted L-path
- Conflict-free routing of multi-stop warehouse trucks
- An approximation algorithm for vehicle routing with compatibility constraints
- An adaptive routing approach for personal rapid transit
- Computational complexity of convoy movement planning problems
- Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications
This page was built for publication: Approximation Algorithms for Conflict-Free Vehicle Routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092267)