In their paper [Doulliez, P. J., M. R. Rao. 1971. Maximal flow in a multi-terminal network with any one are subject to failure. Management Sci. 18 (1, September) 48-58.], Doulliez and Rao present algorithms that solve two flow problems for a single source, multi-terminal network. The first...

The Chinese postman problem is to find a least cost way to traverse each arc of a network at least once and to return to the vertex from which you started. Diverse problems such as the routing of road crews, police patrol scheduling, garbage collection and the programming of computer map...