Algorithms for Time-Dependent Bicriteria Shortest Path Problems : (revised version)
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Report in Wirtschaftsmathematik (WIMA Report) ; 89
- Ereignis
-
Veröffentlichung
- (wo)
-
Kaiserslautern
- (wer)
-
Technische Universität Kaiserslautern, Fachbereich Mathematik
- (wann)
-
2004
- Urheber
-
Hamacher, Horst W.
Ruzika, Stefan
Tjandra, Stevanus A.
- URN
-
urn:nbn:de:hbz:386-kluedo-15811
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:49 MEZ
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
- Hamacher, Horst W.
- Ruzika, Stefan
- Tjandra, Stevanus A.
- Technische Universität Kaiserslautern, Fachbereich Mathematik
Entstanden
- 2004
Ähnliche Objekte (12)
New Multiobjective Shortest Path Algorithms
Engineering planar-separator and shortest-path algorithms
Hierarchical speed-up techniques for shortest-path algorithms
Algorithms for Time Dependent Bicriteria Shortest Path Problems
Distributed shortest-path computation
Shortest path network problems
Variants of the Shortest Path Problem
Some results on heuristical algorithms for shortest path problems in large road networks
Some results on heuristical algorithms for shortest path problems in large road networks
Shortest path embeddings of graphs on surfaces
On Non-Classical Stochastic Shortest Path Problems
The Shapley value for shortest path games
New Multiobjective Shortest Path Algorithms
Engineering planar-separator and shortest-path algorithms
Hierarchical speed-up techniques for shortest-path algorithms
Algorithms for Time Dependent Bicriteria Shortest Path Problems
Distributed shortest-path computation
Shortest path network problems
Variants of the Shortest Path Problem
Some results on heuristical algorithms for shortest path problems in large road networks
Some results on heuristical algorithms for shortest path problems in large road networks
Shortest path embeddings of graphs on surfaces
On Non-Classical Stochastic Shortest Path Problems
The Shapley value for shortest path games
New Multiobjective Shortest Path Algorithms
Engineering planar-separator and shortest-path algorithms
Hierarchical speed-up techniques for shortest-path algorithms
Algorithms for Time Dependent Bicriteria Shortest Path Problems
Distributed shortest-path computation
Shortest path network problems
Variants of the Shortest Path Problem
Some results on heuristical algorithms for shortest path problems in large road networks
Some results on heuristical algorithms for shortest path problems in large road networks
Shortest path embeddings of graphs on surfaces
On Non-Classical Stochastic Shortest Path Problems