Practical efficiency of maximum flow algorithms using MA orderings and preflows

Practical efficiency of maximum flow algorithms using MA orderings and preflows

0.00 Avg rating0 Votes
Article ID: iaor20061368
Country: Japan
Volume: 48
Issue: 4
Start Page Number: 297
End Page Number: 307
Publication Date: Dec 2005
Journal: Journal of the Operations Research Society of Japan
Authors: ,
Keywords: programming: nonlinear
Abstract:

Fujishige proposed a polynomial-time maximum flow algorithm using maximum adjacency (MA) orderings. Computational results by Fujishige and Isotani showed that the algorithm was slower in practice than Goldberg and Tarjan's algorithm. In this paper we propose an improved version of Fujishige's algorithm using preflows. Our computational results show that the improved version is much faster than the original one in practice.

Reviews

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