Home > Research > Publications & Outputs > A cutting plane algorithm for the general routi...

Research

Links

Text available via DOI:

Keywords

View graph of relations

A cutting plane algorithm for the general routing problem

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

Published

Standard

A cutting plane algorithm for the general routing problem. / Corberan, A; Sanchis, J M; Letchford, A N.
In: Mathematical Programming, Vol. 90, No. 2, 2001, p. 291-316.

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

Harvard

Corberan, A, Sanchis, JM & Letchford, AN 2001, 'A cutting plane algorithm for the general routing problem', Mathematical Programming, vol. 90, no. 2, pp. 291-316. https://doi.org/10.1007/PL00011426

APA

Corberan, A., Sanchis, J. M., & Letchford, A. N. (2001). A cutting plane algorithm for the general routing problem. Mathematical Programming, 90(2), 291-316. https://doi.org/10.1007/PL00011426

Vancouver

Corberan A, Sanchis JM, Letchford AN. A cutting plane algorithm for the general routing problem. Mathematical Programming. 2001;90(2):291-316. doi: 10.1007/PL00011426

Author

Corberan, A ; Sanchis, J M ; Letchford, A N. / A cutting plane algorithm for the general routing problem. In: Mathematical Programming. 2001 ; Vol. 90, No. 2. pp. 291-316.

Bibtex

@article{c510130b9ee647859de48db780c6c218,
title = "A cutting plane algorithm for the general routing problem",
abstract = "The General Routing Problem (GRP) is the problem of finding a minimum cost route for a single vehicle, subject to the condition that the vehicle visits certain vertices and edges of a network. It contains the Rural Postman Problem, Chinese Postman Problem and Graphical Travelling Salesman Problem as special cases. We describe a cutting plane algorithm for the GRP based on facet-inducing inequalities and show that it is capable of providing very strong lower bounds and, in most cases, optimal solutions.",
keywords = "cutting planes, General Routing Problem, Rural Postman Problem, Arc Routing",
author = "A Corberan and Sanchis, {J M} and Letchford, {A N}",
year = "2001",
doi = "10.1007/PL00011426",
language = "English",
volume = "90",
pages = "291--316",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer-Verlag GmbH and Co. KG",
number = "2",

}

RIS

TY - JOUR

T1 - A cutting plane algorithm for the general routing problem

AU - Corberan, A

AU - Sanchis, J M

AU - Letchford, A N

PY - 2001

Y1 - 2001

N2 - The General Routing Problem (GRP) is the problem of finding a minimum cost route for a single vehicle, subject to the condition that the vehicle visits certain vertices and edges of a network. It contains the Rural Postman Problem, Chinese Postman Problem and Graphical Travelling Salesman Problem as special cases. We describe a cutting plane algorithm for the GRP based on facet-inducing inequalities and show that it is capable of providing very strong lower bounds and, in most cases, optimal solutions.

AB - The General Routing Problem (GRP) is the problem of finding a minimum cost route for a single vehicle, subject to the condition that the vehicle visits certain vertices and edges of a network. It contains the Rural Postman Problem, Chinese Postman Problem and Graphical Travelling Salesman Problem as special cases. We describe a cutting plane algorithm for the GRP based on facet-inducing inequalities and show that it is capable of providing very strong lower bounds and, in most cases, optimal solutions.

KW - cutting planes

KW - General Routing Problem

KW - Rural Postman Problem

KW - Arc Routing

U2 - 10.1007/PL00011426

DO - 10.1007/PL00011426

M3 - Journal article

VL - 90

SP - 291

EP - 316

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 2

ER -