| Article ID: | iaor20072331 |
| Country: | United Kingdom |
| Volume: | 33 |
| Issue: | 12 |
| Start Page Number: | 3458 |
| End Page Number: | 3472 |
| Publication Date: | Dec 2006 |
| Journal: | Computers and Operations Research |
| Authors: | Whlk Sanne |
| Keywords: | computational analysis, programming: integer, networks |
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.