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

DOI10.1016/J.COR.2012.11.014zbMATH Open1349.90807OpenAlexW2005370463MaRDI QIDQ340291FDOQ340291

Authors: Lukas Bach, Geir Hasle, Sanne Wøhlk 

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

Recommendations

• Lower and upper bounds for the mixed capacitated arc routing problem
• The Capacitated Arc Routing Problem: Lower bounds
• New lower bounds for the Capacitated Arc Routing Problem
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM

zbMATH Keywords

experimentbenchmarkboundvehicle routingarc routingnode routingCARPgeneral routingMCGRPNEARPVRP

Mathematics Subject Classification ID

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

Cited In (7)

• Branch-price-and-cut for the mixed capacitated general routing problem with time windows
• An updated annotated bibliography on arc routing problems
• Two-phase branch-and-cut for the mixed capacitated general routing problem
• The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
• The undirected capacitated general routing problem with profits
• 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

Uses Software

• CBMix

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340291)