Postman needs to visit all 5 geographically distributed post offices beginning and ending at the same post office and without visiting any other post office twice. We need to find the optimum path for the postman so that he covers the minimum possible distance. This is an example of: