12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

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

« Back

The rural postman problem with deadline classes

Research output: Contribution to journalJournal article

Published

<mark>Journal publication date</mark>16/03/1998
<mark>Journal</mark>European Journal of Operational Research
Issue3
Volume105
Number of pages11
Pages390-400
<mark>Original language</mark>English

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.

Related projects