Modeling and solving the capacitated vehicle routing problem on trees
DOI10.1007/978-0-387-77778-8_11zbMATH Open1187.90043OpenAlexW2114447390MaRDI QIDQ3564359FDOQ3564359
Authors:
Publication date: 2 June 2010
Published in: Operations Research/Computer Science Interfaces (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-77778-8_11
Recommendations
integer linear programming formulationscapacitated vehicle routing on treeshigh-level modeling languages
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Cites Work
- A Modeling Language for Mathematical Programming
- Title not available (Why is that?)
- The vehicle routing problem
- Title not available (Why is that?)
- Capacitated Vehicle Routing on Trees
- Branch-and-bound algorithms for the multi-product assembly line balancing problem
- Modeling languages in mathematical optimization.
- Two exact algorithms for the vehicle routing problem on trees
- Heuristics for vehicle routing on tree-like networks
Cited In (9)
- Title not available (Why is that?)
- Capacitated Vehicle Routing on Trees
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes
Uses Software
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)
