//-->
An algorithmic study of the Maximum Flow problem: A comparative statistical analysis
Sedeño-Noda, A., (2000)
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
Sedeño-Noda, A., (2009)
New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels