Displaying similar documents to “Continuation in metric spaces”

Path differentiation: further unification

Udayan Darji, Michael Evans (1995)

Fundamenta Mathematicae

Similarity:

A. M. Bruckner, R. J. O'Malley, and B. S. Thomson introduced path differentiation as a vehicle for unifying the theory of numerous types of generalized differentiation of real valued functions of a real variable. Part of their classification scheme was based on intersection properties of the underlying path systems. Here, additional light is shed on the relationships between these various types of path differentiation and it is shown how composite differentiation and first return differentiation...

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

Multiple routing strategies in a labelled network

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.