Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

  • 1975-1979  (1)
  • 1
    ISSN: 1432-5217
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Es wird das Problem betrachtet, kürzeste Wege in Graphen zu finden, bei denen die Kantenlängen zeitabhängig sind. Die hierfür bisher vorgeschlagenen Algorithmen sind nur anwendbar, wenn keine Einschränkungen für die Parkmöglichkeiten in den Knoten bestehen. Hier wird ein Algorithmus angegeben, der derartige Einschränkungen berücksichtigt. Einige mögliche Erweiterungen werden diskutiert.
    Notes: Summary Few algorithms have been proposed for the solution of the shortest route problem with time dependent lengths of edges. These algorithms are valid only under the assumption that parking in the nodes is unlimited and any desirable delay in departure time from a given node is permitted. This paper considers the case where such an assumption is not acceptable, and presents an efficient algorithm for the solution of the shortest route problem in networks with time dependent lengths of edges and parking regulations at the nodes. Some other possible extensions are discussed.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...