Chapter 3: The Undirected Chinese Postman Problem
Gilbert Laporte · Society for Industrial and Applied Mathematics eBooks · 2015
3.1 ▪ Introduction The Chinese Postman Problem (CPP) is arguably the most central problem in arc routing. In this chapter we review the undirected version of the CPP, as well as four of its variants: the generalized CPP, the cumulative CPP, the hierarchical CPP, and the CPP with time windows. Another variant, the CPP with profits, will be treated in Chapter 12.