Solvable cases of the k-person Chinese postman problem

Authors:
Wen Lea Pearn
Affiliations:
Department of Industrial Engineering and Management, National Chiao Tung University, Hsinchu, Taiwan, ROC
Venue:
Operations Research Letters
Year:
1994

Citing 5
Cited 1

A new algorithm for the directed Chinese postman problem

Computers and Operations Research
On the windy postman problem on Eulerian graphs

Mathematical Programming: Series A and B
Algorithms for the windy postman problem

Computers and Operations Research
Algorithms for the Chinese postman problem on mixed networks

Computers and Operations Research
On the complexity of edge traversing

Journal of the ACM (JACM)

Note: Parameterized complexity of k-Chinese Postman Problem

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a network, the well-known Chinese Postman Problem (CPP) is to find a shortest postman tour traversing each arc of the network at least once and returning to the depot where the postman started. The CPP is NP-complete in general, but is polynomial-time solvable if the network is totally undirected, totally directed, mixed but even, windy with symmetric cycles, and windy but Eulerian. The k-person Chinese Postman Problem (k-CPP) is a multiple-vehicle extension of the CPP, which has many real-world applications. The intent of this paper is to generalize some of the above cited results to the k-CPP.