Bounds for the general capacitated routing problem

DOI10.1002/net.3230230304zbMath0778.90079OpenAlexW1975085296MaRDI QIDQ5287450

Klaus Jansen

Publication date: 5 September 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230230304

zbMATH Keywords

heuristicsvehicle routinglower boundsroutingworst-case errorcapacitated arc routinggeneral capacitated routing problemtour splitting

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items

Routing problems: A bibliography, On approximate data reduction for the Rural Postman Problem: Theory and experiments, The capacitated arc routing problem with intermediate facilities, Constant-factor approximations for capacitated arc routing without triangle inequality

Cites Work

• Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
• Unnamed Item