Part Special Issue Introduction: modelling organizational knowledge

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.