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 article


<mark>Journal publication date</mark>16/03/1998
<mark>Journal</mark>European Journal of Operational Research
Issue number3
Number of pages11
Pages (from-to)390-400
<mark>Original language</mark>English


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.