Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Heuristics for vehicle routing on tree-like networks

From MaRDI portal
Publication:3157366
Jump to:navigation, search

DOI10.1057/palgrave.jors.2600747zbMath1054.90519OpenAlexW2013672052MaRDI QIDQ3157366

No author found.

Publication date: 13 January 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600747


zbMATH Keywords

heuristicsvehicle routingtree networksavings approach


Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)


Related Items (3)

Modeling and Solving the Capacitated Vehicle Routing Problem on Trees ⋮ Approximation algorithms for the load-balanced capacitated vehicle routing problem ⋮ The preemptive swapping problem on a tree







This page was built for publication: Heuristics for vehicle routing on tree-like networks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3157366&oldid=16294078"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki