Algorithms for capacitated vehicle routing
From MaRDI portal
Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Traffic problems in operations research (90B20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cited in
(18)- Approximation algorithms for the load-balanced capacitated vehicle routing problem
- Optimal online and offline algorithms for robot-assisted restoration of barrier coverage
- Online and offline algorithms for the sorting buffers problem on the line metric
- The pyramidal capacitated vehicle routing problem
- An approximation algorithm for vehicle routing with compatibility constraints
- Capacitated vehicle routing with nonuniform speeds
- Vehicle Routing Algorithms for Radially Escaping Targets
- Balancing the stations of a self service ``bike hire system
- Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand
- Nonpreemptive Ensemble Motion Planning on a Tree
- Optimal online and offline algorithms for robot-assisted restoration of barrier coverage
- Hardness of Preemptive Finite Capacity Dial-a-Ride
- Multiple Capacity Vehicle Routing on Paths
- Approximating Capacitated Routing and Delivery Problems
- scientific article; zbMATH DE number 1775420 (Why is no real title available?)
- Bike rebalancing: how to find a balanced matching in the k center problem?
- The vehicle routing problem with transfers
- Semi-preemptive routing on a linear and circular track
This page was built for publication: Algorithms for capacitated vehicle routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784475)