- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2193-1801
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
The shortest path problem in the stochastic networks with unstable topology ; volume:5 ; number:1 ; day:13 ; month:9 ; year:2016 ; pages:1-12 ; date:12.2016
SpringerPlus ; 5, Heft 1 (13.9.2016), 1-12, 12.2016
- Creator
-
Shirdel, Gholam H.
- Contributor
-
Abdolhosseinzadeh, Mohsen
SpringerLink (Online service)
- DOI
-
10.1186/s40064-016-3180-7
- URN
-
urn:nbn:de:1111-201610141822
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 14.08.2025, 10:52 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Shirdel, Gholam H.
- Abdolhosseinzadeh, Mohsen
- SpringerLink (Online service)
Other Objects (12)
On Non-Classical Stochastic Shortest Path Problems
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
The Shapley value for shortest path games
Shortest path counting in probabilistic biological networks
Engineering planar-separator and shortest-path algorithms
Robot Navigation Beyond Planning the Shortest Path
On Non-Classical Stochastic Shortest Path Problems
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
The Shapley value for shortest path games
Shortest path counting in probabilistic biological networks
Engineering planar-separator and shortest-path algorithms
Robot Navigation Beyond Planning the Shortest Path
On Non-Classical Stochastic Shortest Path Problems
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
The Shapley value for shortest path games
Shortest path counting in probabilistic biological networks
Engineering planar-separator and shortest-path algorithms