| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 482420 | European Journal of Operational Research | 2007 | 15 Pages |
Abstract
In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains several important Arc Routing Problems as special cases and has very interesting real-life applications. Extensive computational experiments over different sets of instances are also presented.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Enrique Benavent, Alessandro Carrotta, Angel Corberán, José M. Sanchis, Daniele Vigo,