| Article ID: | iaor19992357 |
| Country: | Netherlands |
| Volume: | 105 |
| Issue: | 3 |
| Start Page Number: | 390 |
| End Page Number: | 400 |
| Publication Date: | Mar 1998 |
| Journal: | European Journal of Operational Research |
| Authors: | Eglese R.W., Letchford A.N. |
| Keywords: | programming: integer, networks: path |
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.