A lower bound for the node, edge, and arc routing problem

DOI10.1016/J.COR.2012.11.014zbMath1349.90807OpenAlexW2005370463MaRDI QIDQ340291

Lukas Bach, Sanne Wøhlk, Geir Hasle

Publication date: 14 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11250/2458549

zbMATH Keywords

experimentvehicle routingboundbenchmarkarc routingnode routingCARPgeneral routingMCGRPNEARPVRP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Production models (90B30)

Related Items (6)

Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ The bi-objective mixed capacitated general routing problem with different route balance criteria ⋮ Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ The undirected capacitated general routing problem with profits ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows

Uses Software

• CBMix

This page was built for publication: A lower bound for the node, edge, and arc routing problem