Article ID: | iaor2007377 |
Country: | United States |
Volume: | 47 |
Issue: | 1 |
Start Page Number: | 52 |
End Page Number: | 60 |
Publication Date: | Jan 2006 |
Journal: | Networks |
Authors: | Maniezzo V., Baldacci R. |
Keywords: | programming: branch and bound |
This article proposes a new transformation of undirected arc-routing problems into equivalent node-routing problems, with emphasis on the transformation of Capacitated Arc Routing Problems (CARP) into Capacitated Vehicle Routing Problems (CVRP). For this last case, an analogue transformation has already been proposed in Pearn