A network problem that can be formulated as a combinatorial optimization problem. A postman has to travel down every street in a town. The streets have different lengths. The problem is to devise a route that minimizes the distance the postman travels. The adjective ‘Chinese’ refers to the nationality of the original poser of the problem (Mei-Ku Kuan) and not to any unusual behaviour by Chinese postmen.