Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
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 -