A new algorithm for reoptimizing shortest paths when the arc costs change
Year of publication: |
2003
|
---|---|
Authors: | Pallottino, Stefano ; Scutellà, Maria Grazia |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 31.2003, 2, p. 149-160
|
Saved in:
Saved in favorites
Similar items by person
-
A dual simplex algorithm for finding all shortest paths
Florian, Michael Alexander, (1980)
-
Paradoxes in equilibrium traffic assignment and their implications for optimal planning strategies
Fisk, Caroline, (1980)
-
Shortest path methods : complexity, interrelations and new propositions
Pallottino, Stefano, (1981)
- More ...