An efficient label setting/correcting shortest path algorithm
Year of publication: |
2012
|
---|---|
Authors: | Sedeño-Noda, Antonio ; González-Martín, Carlos |
Published in: |
Computational Optimization and Applications. - Springer. - Vol. 51.2012, 1, p. 437-455
|
Publisher: |
Springer |
Subject: | Network/Graphs | Distance algorithms | Design and analysis of algorithms | Pseudo permanent labels |
-
New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels
Sedeño-Noda, A., (2009)
-
Preferences, homophily, and social learning
Lobel, Ilan, (2016)
- More ...
-
On the K shortest path trees problem
Sedeño-Noda, Antonio, (2010)
-
Firm and industry level profit efficiency analysis using absolute and uniform shadow prices
Sedeño-Noda, Antonio, (2010)
-
Enumerating K best paths in length order in DAGs
Pascoal, Marta M.B., (2012)
- More ...