We present the results of a computational investigation of the pseudoflow and push-relabel algorithms for the maximum flow and minimum s-t cut problems. The two algorithms were tested on several problem instances from the literature. Our results show that our implementation of the pseudoflow algorithm is faster than the best-known implementation of push-relabel on most of the problem instances within our computational study.
Description
A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem
%0 Journal Article
%1 chandran_09_pseudoflow
%A Chandran, Bala G.
%A Hochbaum, Dorit S.
%C Institute for Operations Research and the Management Sciences (INFORMS), Linthicum, Maryland, USA
%D 2009
%I INFORMS
%J Operations Research
%K flow max pseudoflow push-relabel
%N 2
%P 358--376
%R 10.1287/opre.1080.0572
%T A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem
%U http://portal.acm.org/citation.cfm?id=1536016
%V 57
%X We present the results of a computational investigation of the pseudoflow and push-relabel algorithms for the maximum flow and minimum s-t cut problems. The two algorithms were tested on several problem instances from the literature. Our results show that our implementation of the pseudoflow algorithm is faster than the best-known implementation of push-relabel on most of the problem instances within our computational study.
@article{chandran_09_pseudoflow,
abstract = {We present the results of a computational investigation of the pseudoflow and push-relabel algorithms for the maximum flow and minimum s-t cut problems. The two algorithms were tested on several problem instances from the literature. Our results show that our implementation of the pseudoflow algorithm is faster than the best-known implementation of push-relabel on most of the problem instances within our computational study.},
added-at = {2010-05-26T10:34:42.000+0200},
address = {Institute for Operations Research and the Management Sciences (INFORMS), Linthicum, Maryland, USA},
author = {Chandran, Bala G. and Hochbaum, Dorit S.},
biburl = {https://www.bibsonomy.org/bibtex/215166580ca1770e070493ee5fd783f1b/ukoethe},
description = {A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem},
doi = {10.1287/opre.1080.0572},
interhash = {0e8d7b9f3637ae7ef70c1851135923dd},
intrahash = {15166580ca1770e070493ee5fd783f1b},
issn = {0030-364X},
journal = {Operations Research},
keywords = {flow max pseudoflow push-relabel},
number = 2,
pages = {358--376},
publisher = {INFORMS},
timestamp = {2010-05-26T10:34:42.000+0200},
title = {A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem},
url = {http://portal.acm.org/citation.cfm?id=1536016},
volume = 57,
year = 2009
}