Vehicle Routing Algorithms for Radially Escaping Targets
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3989085
- The rendezvous vehicle routing problem
- Algorithms for capacitated vehicle routing
- scientific article; zbMATH DE number 1775420
- Vehicle Routing
- Approximation algorithms for a vehicle routing problem
- The vehicle routing problem with floating targets: formulation and solution approaches
- Approximation algorithms for some vehicle routing problems
- On Euclidean Vehicle Routing with Allocation
- On Euclidean vehicle routing with allocation
Cites work
- A Cooperative Receding Horizon Controller for Multivehicle Uncertain Environments
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- Approximating Capacitated Routing and Delivery Problems
- Approximation results for kinetic variants of TSP
- Dynamic Vehicle Routing for Translating Demands: Stability Analysis and Receding-Horizon Policies
- Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem
- Grasp and delivery for moving objects on broken lines
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- scientific article; zbMATH DE number 5728694 (Why is no real title available?)
- scientific article; zbMATH DE number 53676 (Why is no real title available?)
- scientific article; zbMATH DE number 3522951 (Why is no real title available?)
- scientific article; zbMATH DE number 3204219 (Why is no real title available?)
- Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space
- The moving-target traveling salesman problem
- The vehicle routing problem
Cited in
(3)
This page was built for publication: Vehicle Routing Algorithms for Radially Escaping Targets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949981)