Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 33, Issue 12, Pages 3458-3472Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2005.02.015
Keywords
Capacitated Arc Routing Problem; lower bounds
Ask authors/readers for more resources
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. (c) 2005 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
