| Article ID: | iaor2000852 |
| Country: | Netherlands |
| Volume: | 112 |
| Issue: | 1 |
| Start Page Number: | 122 |
| End Page Number: | 133 |
| Publication Date: | Jan 1999 |
| Journal: | European Journal of Operational Research |
| Authors: | Letchford Adam N. |
| Keywords: | programming: travelling salesman |
It is shown how to transform the General Routing Problem (GRP) into a variant of the Graphical Travelling Salesman Problem (GTSP). This transformation yields a projective characterisation of the GRP polyhedron. Using this characterisation, it is shown how to convert facets of the GTSP polyhedron into valid inequalities for the GRP polyhedron. The resulting classes of inequalities subsume several previously published classes.