We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK


93% of Lancaster students go into work or further study within six months of graduating

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

« Back

The general routing polyhedron: a unifying framework

Research output: Contribution to journalJournal article


Journal publication date1/01/1999
JournalEuropean Journal of Operational Research
Number of pages12
Original languageEnglish


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.

Related projects