Arc Routing Problems, Part I: The Chinese 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.