首页 | 本学科首页   官方微博 | 高级检索  
     


An algorithmic study of the Maximum Flow problem: A comparative statistical analysis
Authors:A. Sedeño-Noda  M. A. González-Sierra  C. González-Martín
Affiliation:(1) Departamento de Estadística, Investigación Operativa y Computación, Universidad de La Laguna, 38271 La Laguna, (Tenerife), Spain
Abstract: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.
Keywords:Network programming  Maximum Flow Algorithm  Experimental Design  Statistical Analysis
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号