- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2193-1801
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
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
- Urheber
-
Shirdel, Gholam H.
- Beteiligte Personen und Organisationen
-
Abdolhosseinzadeh, Mohsen
SpringerLink (Online service)
- DOI
-
10.1186/s40064-016-3180-7
- URN
-
urn:nbn:de:1111-201610141822
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:52 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Shirdel, Gholam H.
- Abdolhosseinzadeh, Mohsen
- SpringerLink (Online service)
Ähnliche Objekte (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
Towards shortest path identification on large networks
Engineering planar-separator and shortest-path algorithms
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
Towards shortest path identification on large networks
Engineering planar-separator and shortest-path algorithms
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
Towards shortest path identification on large networks