Modeling and solving the capacitated vehicle routing problem on trees
From MaRDI portal
Publication:3564359
Recommendations
Cites work
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A Modeling Language for Mathematical Programming
- Branch-and-bound algorithms for the multi-product assembly line balancing problem
- Capacitated Vehicle Routing on Trees
- Heuristics for vehicle routing on tree-like networks
- Modeling languages in mathematical optimization.
- The vehicle routing problem
- Two exact algorithms for the vehicle routing problem on trees
Cited in
(9)- scientific article; zbMATH DE number 1303035 (Why is no real title available?)
- Capacitated Vehicle Routing on Trees
- scientific article; zbMATH DE number 1184494 (Why is no real title available?)
- An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach
- Approximation algorithms for the load-balanced capacitated vehicle routing problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Balancing profits and costs on trees
- scientific article; zbMATH DE number 6913886 (Why is no real title available?)
- Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes
This page was built for publication: Modeling and solving the capacitated vehicle routing problem on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564359)