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.
Official URL: https://doi.org/10.1016/S0377-2217(97)00377-9
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:
?? ARC ROUTING PROBLEMSPOLYHEDRAL COMBINATORICSPOLYHEDRAVALID INEQUALITIESGENERAL ROUTING PROBLEMMODELLING AND SIMULATIONMANAGEMENT SCIENCE AND OPERATIONS RESEARCHINFORMATION SYSTEMS AND MANAGEMENTDISCIPLINE-BASED RESEARCH ??
Departments:
ID Code:
43274
Deposited By:
Deposited On:
11 Jul 2011 17:56
Refereed?:
Yes
Published?:
Published
Last Modified:
20 Sep 2023 00:11