The general routing polyhedron:a unifying framework

Letchford, A. N. (1999) The general routing polyhedron:a unifying framework. European Journal of Operational Research, 112 (1). pp. 122-133. ISSN 0377-2217

Full text not available from this repository.

Abstract

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.

Item Type: Journal Article
Journal or Publication Title: European Journal of Operational Research
Uncontrolled Keywords: /dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
Departments: Lancaster University Management School > Management Science
ID Code: 43274
Deposited By: ep_importer_pure
Deposited On: 11 Jul 2011 17:56
Refereed?: Yes
Published?: Published
Last Modified: 30 Jul 2019 00:53
URI: https://eprints.lancs.ac.uk/id/eprint/43274

Actions (login required)

View Item View Item