A survey of combinatorial maximum flow algorithms on a network with gains

A survey of combinatorial maximum flow algorithms on a network with gains

0.00 Avg rating0 Votes
Article ID: iaor20051925
Country: Japan
Volume: 47
Issue: 4
Start Page Number: 244
End Page Number: 264
Publication Date: Dec 2004
Journal: Journal of the Operations Research Society of Japan
Authors:
Keywords: optimization, programming: mathematical, programming: network
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.