Hochschulschrift
Some results on heuristical algorithms for shortest path problems in large road networks
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
21 cm
- Extent
-
IV, 166 S.
- Language
-
Englisch
- Notes
-
graph. Darst.
Köln, Univ., Diss., 2000 (Nicht für den Austausch)
- Keyword
-
Kürzester-Weg-Problem
Heuristik
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 2:30 PM 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.
Object type
- Hochschulschrift
Associated
Other Objects (12)
Some results on heuristical algorithms for shortest path problems in large road networks
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
Algorithms for Time-Dependent Bicriteria Shortest Path Problems : (revised version)
Distributed shortest-path computation
Shortest path network problems
Engineering shortest paths and layout algorithms for large graphs
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
On Non-Classical Stochastic Shortest Path Problems
Some results on heuristical algorithms for shortest path problems in large road networks
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
Algorithms for Time-Dependent Bicriteria Shortest Path Problems : (revised version)
Distributed shortest-path computation
Shortest path network problems
Engineering shortest paths and layout algorithms for large graphs
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
On Non-Classical Stochastic Shortest Path Problems
Some results on heuristical algorithms for shortest path problems in large road networks
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
Algorithms for Time-Dependent Bicriteria Shortest Path Problems : (revised version)
Distributed shortest-path computation
Shortest path network problems
Engineering shortest paths and layout algorithms for large graphs
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces