Hochschulschrift

Constrained shortest paths and related problems

to connected objects

Location
Deutsche Nationalbibliothek Frankfurt am Main
Dimensions
21 cm
Extent
III, 141 S.
Language
Englisch
Notes
graph. Darst.
Saarbrücken, Univ., Diss., 2001

Keyword
Kürzester-Weg-Problem
Nebenbedingung
Relaxationsmethode
Mehrschrittverfahren
Kürzester-Weg-Problem ; Nebenbedingung ; Relaxationsmethode ; Mehrschrittverfahren

Creator
Ziegelmann, Mark

Table of contents
Rights
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
Last update
11.03.2025, 12:21 PM CET

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Object type

  • Hochschulschrift

Associated

  • Ziegelmann, Mark

Other Objects (12)

Constrained shortest paths and related problems

Hochschulschrift | Online-Publikation

Constrained shortest paths and related problems

Shortest Paths II

zweidimensionales bewegtes Bild

Shortest Paths II

Universal Shortest Paths

Universal Shortest Paths

Average-case complexity of shortest-paths problems

Hochschulschrift

Average-case complexity of shortest-paths problems

Average-case complexity of shortest-paths problems

Hochschulschrift

Average-case complexity of shortest-paths problems

Shortest Paths III / Network Flows

zweidimensionales bewegtes Bild

Shortest Paths III / Network Flows

Timetable information and shortest paths

Timetable information and shortest paths

Shortest Paths for Line Segments

Shortest Paths for Line Segments

Most Diverse Near-Shortest Paths

Most Diverse Near-Shortest Paths

Unobstructed shortest paths in polyhedral environments

Unobstructed shortest paths in polyhedral environments

Drawing Shortest Paths in Geodetic Graphs

Drawing Shortest Paths in Geodetic Graphs

Encoding Shortest Paths in Spatial Networks

Encoding Shortest Paths in Spatial Networks

Related objects