Article ID: | iaor20013447 |
Country: | Germany |
Volume: | 87 |
Issue: | 3 |
Start Page Number: | 467 |
End Page Number: | 481 |
Publication Date: | Jan 2000 |
Journal: | Mathematical Programming |
Authors: | Laporte G., Ghiani G. |
Keywords: | programming: integer |
The well-known Undirected Rural Postman Problem is considered and a binary linear problem using new dominance relations is presented. Polyhedral properties are investigated and a branch-and-cut algorithm is developed. Extensive computational results indicate that the algorithm is capable of solving much larger instances than previously reported.