Title of article
Exact solution of the generalized routing problem through graph transformations
Author/Authors
Blais، M نويسنده , , Laporte، G نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
-905
From page
906
To page
0
Abstract
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.
Keywords
rural postman problem , Traveling salesman problem , generalized routing problem , generalized traveling salesman problem
Journal title
Journal of the Operational Research Society (JORS)
Serial Year
2003
Journal title
Journal of the Operational Research Society (JORS)
Record number
93212
Link To Document