Blais, M.; Laporte, G. Exact solution of the generalized routing problem through graph transformations. (English) Zbl 1095.90522 J. Oper. Res. Soc. 54, No. 8, 906-910 (2003). Summary: In the general routing problem, the aim is to determine a least cost traversal of a subset of edges, arcs and vertices of a graph. The problem can be transformed into an equivalent traveling salesman problem or rural postman problem and solved optimally. Computational results are reported. Cited in 10 Documents MSC: 90B20 Traffic problems in operations research Keywords:generalized routing problem; traveling salesman problem; rural postman problem; generalized traveling salesman problem Software:CDT PDFBibTeX XMLCite \textit{M. Blais} and \textit{G. Laporte}, J. Oper. Res. Soc. 54, No. 8, 906--910 (2003; Zbl 1095.90522) Full Text: DOI