23
What's the difference between travelling salesman problem (TSP) and Chinese postman problem (CPP)?
For me, both wants go to a destination, and then back.
What's the difference between travelling salesman problem (TSP) and Chinese postman problem (CPP)?
For me, both wants go to a destination, and then back.
From a brief read of the two articles (and I never took a course in graph theory, so I could be talking through my hat), it appears that the "CPP" involves visiting all edges, and the "TSP" involves visiting all nodes.
The key difference between the two is:
The travelling salesman problem can not visit a node more than once. The path produced will consist of all different nodes/cities.
The Chinese postman/route inspection problem can have duplicate nodes in the path produced (but not duplicate edges). I.e., nodes can be visited more than once as long as you take a different route out than you took in.