New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels
| Year of publication: |
2009
|
|---|---|
| Authors: | Sedeño-Noda, A. ; González-Martín, C. |
| Published in: |
Computational Optimization and Applications. - Springer. - Vol. 43.2009, 3, p. 437-448
|
| Publisher: |
Springer |
| Subject: | Shortest path problem | Shortest path simplex algorithm | Pseudo permanent labels |
-
An efficient label setting/correcting shortest path algorithm
Sedeño-Noda, Antonio, (2012)
-
An exact algorithm for the elementary shortest path problem with resource constraints
Lozano, Leonardo, (2016)
-
Kristiano, Yohanes, (2014)
- More ...
-
An algorithmic study of the Maximum Flow problem: A comparative statistical analysis
Sedeño-Noda, A., (2000)
-
Sedeño-Noda, A., (2009)
-
Preemptive benchmarking problem: An approach for official statistics in small areas
Sedeño-Noda, A., (2009)
- More ...