Can I read Minimum Cost Flow via Successive Paths on EtoBox?

Minimum Cost Flow via Successive Paths by Chiranjit Sau is a document available to read on EtoBox.

What is Minimum Cost Flow via Successive Paths about?

The document describes an algorithm called Successive Shortest Paths for solving the Minimum Cost Flow problem. It works by: 1. Initializing the flow to 0 and maintaining a potential function π such that the flow satisfies reduced cost optimality. 2. Repeatedly finding a shortest path between an excess node and deficit node in the residual graph, sending flow along the path, and updating the flow and potential function. 3. Using capacity scaling to speed up the algorithm, by only allowing paths of a ce

Author

Chiranjit Sau

Language

EN