| Article ID: | iaor19982250 |
| Country: | United States |
| Volume: | 43 |
| Issue: | 2 |
| Start Page Number: | 231 |
| End Page Number: | 242 |
| Publication Date: | Mar 1995 |
| Journal: | Operations Research |
| Authors: | Laporte Gilbert, Eiselt H.A., Gendreau Michel |
| Keywords: | postman problem |
Arc routing problems arise in several areas of distribution management and have long been the object of study by mathematicians and operations researchers. In the first of a two-part survey, the Chinese postman problem (CPP) is considered. The main algorithmic results for the CPP are reviewed in five main sections: the undirected CPP, the directed CPP, the windy postman problem, the mixed CPP, and the hierarchical CPP.