The short URL to these pages that could also be used for citation is http://www.sintef.no/nearp .
Your detailed solutions will be checked by our solution checker. The format for solutions is documented here. Please send your detailed solutions, new lower bounds, or other relevant information by email to firstname.lastname@example.org
 Christian Prins and Samir Bouchenoua. A memetic algorithm solving the VRP, the CARP and general routing problems with nodes, edges and arcs. In W Hart, N Krasnogor, and J Smith, editors, Recent Advances in Memetic Algorithms, Studies in Fuzziness and Soft Computing, pages 65–85. Springer, 2004.
 Lukas Bach, Geir Hasle, Sanne Wøhlk: A Lower Bound for the Node, Edge, and Arc Routing Problem. Computers & Operations Research 40 (2013) 943–952.
 G. Hasle, O. Kloster, M. Smedsrud and K. Gaze, Experiments on the node, edge, and arc routing problem. Technical report A23265, SINTEF, May 2012. ISBN 978-82-14-05288-6 (444 KB).
 R. Pandi and B. Muralidharan (1995). A capacitated general routing problem on mixed networks. Computers & Operations Research, 22(5):465 – 478.
 J. C. A. Gutiérrez, D. Soler, and Antonio Hervás (2002). The capacitated general routing problem on mixed graphs. Revista Investigacion Operacional, 23(1):15 – 26, 2002.
 A. Bosco, D. Lagana, R. Musmanno, and F. Vocaturo. Modeling and solving the mixed capacitated general routing problem. Optimization Letters, October 2013, Volume 7, Issue 7, pp 1451-1469.
Published June 12, 2012