Abstract

This paper first presents the method for finding a generalized augmenting path according to the idea of Dijkstra's algorithm. Then the combinatorial algorithm for solving the generalized maximum flow is given in lossy network. The algorithm runs in strongly polynomial times by finding the generalized f-augmenting path in a generalized residual network.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call