Home > Research > Publications & Outputs > The rural postman problem with deadline classes
View graph of relations

The rural postman problem with deadline classes

Research output: Contribution to journalJournal articlepeer-review

Published

Standard

The rural postman problem with deadline classes. / Eglese, R. W.; Letchford, A. N.

In: European Journal of Operational Research, Vol. 105, No. 3, 16.03.1998, p. 390-400.

Research output: Contribution to journalJournal articlepeer-review

Harvard

Eglese, RW & Letchford, AN 1998, 'The rural postman problem with deadline classes', European Journal of Operational Research, vol. 105, no. 3, pp. 390-400. https://doi.org/10.1016/S0377-2217(97)00090-8

APA

Vancouver

Author

Eglese, R. W. ; Letchford, A. N. / The rural postman problem with deadline classes. In: European Journal of Operational Research. 1998 ; Vol. 105, No. 3. pp. 390-400.

Bibtex

@article{7fd8855756f1410890e90b3f9b126f9c,
title = "The rural postman problem with deadline classes",
abstract = "Vehicle routing problems with general time windows are extremely difficult to solve. However, the time windows in a particular problem may have a special structure which can be exploited. We consider a single-vehicle arc routing problem in which the arcs are partitioned into deadline classes. It is shown that a cutting-plane approach works well for this problem.",
keywords = "arc routing problems, integer programming, polyhedral combinatorics, Rural postman problem, Time windows, Cutting-planes",
author = "Eglese, {R. W.} and Letchford, {A. N.}",
year = "1998",
month = mar,
day = "16",
doi = "10.1016/S0377-2217(97)00090-8",
language = "English",
volume = "105",
pages = "390--400",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier Science B.V.",
number = "3",

}

RIS

TY - JOUR

T1 - The rural postman problem with deadline classes

AU - Eglese, R. W.

AU - Letchford, A. N.

PY - 1998/3/16

Y1 - 1998/3/16

N2 - Vehicle routing problems with general time windows are extremely difficult to solve. However, the time windows in a particular problem may have a special structure which can be exploited. We consider a single-vehicle arc routing problem in which the arcs are partitioned into deadline classes. It is shown that a cutting-plane approach works well for this problem.

AB - Vehicle routing problems with general time windows are extremely difficult to solve. However, the time windows in a particular problem may have a special structure which can be exploited. We consider a single-vehicle arc routing problem in which the arcs are partitioned into deadline classes. It is shown that a cutting-plane approach works well for this problem.

KW - arc routing problems

KW - integer programming

KW - polyhedral combinatorics

KW - Rural postman problem

KW - Time windows

KW - Cutting-planes

U2 - 10.1016/S0377-2217(97)00090-8

DO - 10.1016/S0377-2217(97)00090-8

M3 - Journal article

VL - 105

SP - 390

EP - 400

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -