Displaying similar documents to “Path differentiation: further unification”

The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets

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...

Rough paths via sewing Lemma

Laure Coutin (2012)

ESAIM: Probability and Statistics

Similarity:

We present the rough path theory introduced by Lyons, using the swewing lemma of Feyel and de Lapradelle.