An algorithmic study of the Maximum Flow problem: A comparative statistical analysis
Year of publication: |
2000
|
---|---|
Authors: | Sedeño-Noda, A. ; González-Sierra, M. ; González-Martín, C. |
Published in: |
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. - Springer. - Vol. 8.2000, 1, p. 135-162
|
Publisher: |
Springer |
Subject: | Network programming | Maximum Flow Algorithm | Experimental Design | Statistical Analysis |
-
Bausell, Rufus Barker, (2002)
-
Chen, Chih-Chien, (2015)
-
A penny for your thoughts : a survey of methods for eliciting beliefs
Schlag, Karl H., (2015)
- More ...
-
New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels
Sedeño-Noda, A., (2009)
-
Sedeño-Noda, A., (2009)
-
Preemptive benchmarking problem: An approach for official statistics in small areas
Sedeño-Noda, A., (2009)
- More ...