Earliest Arrival Flows with Time-Dependent Data

  • In this paper we discuss an earliest arrival flow problem of a network having arc travel times and capacities that vary with time over a finite time horizon T. We also consider the possibility to wait (or park) at a node before departingon outgoing arc. This waiting is bounded by the value of maximum waiting time and the node capacity which also vary with time.

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Author:Horst W. Hamacher, Stevanus A. Tjandra
URN (permanent link):urn:nbn:de:hbz:386-kluedo-12705
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (88)
Document Type:Preprint
Language of publication:English
Year of Completion:2003
Year of Publication:2003
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2003/11/12
GND-Keyword:Dynamic cut; Earliest arrival augmenting path; Network flows
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581 $