Network optimization experienced a fast development, during the last few decades. While a traditional network assumes that each flow is conserved on every arc, a flow along an arc may increase or decrease by a fixed factor during its traversal of that arc in a generalized network. This paper surveys combinatorial maximum flow algorithms on the generalized network and compares algorithms for traditional network flows.
