| Article ID: | iaor20001031 |
| Country: | United States |
| Volume: | 11 |
| Issue: | 1 |
| Start Page Number: | 53 |
| End Page Number: | 62 |
| Publication Date: | Dec 1999 |
| Journal: | INFORMS Journal On Computing |
| Authors: | Laporte Gilbert, Hertz Alain, Hugo Pierrette Nanchen |
| Keywords: | networks: scheduling |
This article describes new construction and postoptimization heuristics for the Undirected Rural Postman Problem. Extensive computational tests indicate that some combinations of these heuristics consistently produce optimal or high-quality solutions.