Home > Research > Publications & Outputs > The general routing polyhedron
View graph of relations

The general routing polyhedron: a unifying framework

Research output: Contribution to journalJournal article

<mark>Journal publication date</mark>1/01/1999
<mark>Journal</mark>European Journal of Operational Research
Issue number1
Number of pages12
Pages (from-to)122-133
<mark>Original language</mark>English


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.