Article ID Journal Published Year Pages File Type
476169 Computers & Operations Research 2006 15 Pages PDF
Abstract

We present a new lower bound, the Multiple Cuts Node Duplication Lower Bound, for the undirected Capacitated Arc Routing Problem. We prove that this new bound dominates the existing bounds for the problem. Computational results are also provided.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
New lower bound for the Capacitated Arc Routing Problem
Authors
,