Home > Research > Publications & Outputs > The general routing polyhedron

Research

Links

Text available via DOI:

Keywords

View graph of relations

The general routing polyhedron: a unifying framework

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

The general routing polyhedron: a unifying framework. / Letchford, A. N.
In: European Journal of Operational Research, Vol. 112, No. 1, 01.01.1999, p. 122-133.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Letchford, AN 1999, 'The general routing polyhedron: a unifying framework', European Journal of Operational Research, vol. 112, no. 1, pp. 122-133. https://doi.org/10.1016/S0377-2217(97)00377-9

APA

Letchford, A. N. (1999). The general routing polyhedron: a unifying framework. European Journal of Operational Research, 112(1), 122-133. https://doi.org/10.1016/S0377-2217(97)00377-9

Vancouver

Letchford AN. The general routing polyhedron: a unifying framework. European Journal of Operational Research. 1999 Jan 1;112(1):122-133. doi: 10.1016/S0377-2217(97)00377-9

Author

Letchford, A. N. / The general routing polyhedron : a unifying framework. In: European Journal of Operational Research. 1999 ; Vol. 112, No. 1. pp. 122-133.

Bibtex

@article{e19c40b326214a1a88666283248e30a4,
title = "The general routing polyhedron: a unifying framework",
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.",
keywords = "arc routing problems, polyhedral combinatorics, polyhedra, Valid inequalities, General routing problem",
author = "Letchford, {A. N.}",
year = "1999",
month = jan,
day = "1",
doi = "10.1016/S0377-2217(97)00377-9",
language = "English",
volume = "112",
pages = "122--133",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier Science B.V.",
number = "1",

}

RIS

TY - JOUR

T1 - The general routing polyhedron

T2 - a unifying framework

AU - Letchford, A. N.

PY - 1999/1/1

Y1 - 1999/1/1

N2 - 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.

AB - 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.

KW - arc routing problems

KW - polyhedral combinatorics

KW - polyhedra

KW - Valid inequalities

KW - General routing problem

U2 - 10.1016/S0377-2217(97)00377-9

DO - 10.1016/S0377-2217(97)00377-9

M3 - Journal article

VL - 112

SP - 122

EP - 133

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -