Article ID: | iaor2002917 |
Country: | Spain |
Volume: | 8 |
Issue: | 1 |
Start Page Number: | 135 |
End Page Number: | 162 |
Publication Date: | Jan 2000 |
Journal: | TOP |
Authors: | Sedeo-Noda A., Gonzlez-Martn C., Gonzlez-Sierra M.A. |
Keywords: | programming: network |
In this paper, we show the results of an experimental study about the most important algorithms proposed to solve the Maximum Flow problem. The appropriate statistical analysis not only allows us to justify comparisons between the different procedures but also to obtain classifications of their practical efficiency. Furthermore, an empirical experiment allows us to identify the influence of several parameters that are not included in a theoretical study.