New complexity results for time-constrained dynamical optimal path problems.
Kluge, Sebastian, Brokate, Martin, Reif, Konrad (2010)
Journal of Graph Algorithms and Applications
Similarity:
Kluge, Sebastian, Brokate, Martin, Reif, Konrad (2010)
Journal of Graph Algorithms and Applications
Similarity:
T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2010)
RAIRO - Operations Research
Similarity:
Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...
Teodros Getachew, Michael Kostreva, Laura Lancaster (2000)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Jack Brimberg, Ephraim Korach, Mokhtar Amami (2005)
The Yugoslav Journal of Operations Research
Similarity:
T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...
J. Maublanc, D. Peyrton, A. Quilliot (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We present here models and algorithms for the construction of efficient path systems, robust to possible variations of the characteristics of the network. We propose some interpretations of these models and proceed to numerical experimentations of the related algorithms. We conclude with a discussion of the way those concepts may be applied to the design of a Public Transportation System.
Brian Boffey (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Bhosle, Amit M., Gonzalez, Teofilo F. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Markov, Minko, Ionut Andreica, Mugurel, Manev, Krassimir, Tapus, Nicolae (2012)
Serdica Journal of Computing
Similarity:
ACM Computing Classification System (1998): G.2.2. We propose an algorithm that computes the length of a longest path in a cactus graph. Our algorithm can easily be modified to output a longest path as well or to solve the problem on cacti with edge or vertex weights. The algorithm works on rooted cacti and assigns to each vertex a two-number label, the first number being the desired parameter of the subcactus rooted at that vertex. The algorithm applies the divide-and-conquer...
Dimiter Ivanchev, Elena Radovanova (2009)
The Yugoslav Journal of Operations Research
Similarity:
Rahim A. Abbaspour, Farhad Samadzadegan (2010)
Computer Science and Information Systems
Similarity: