We study interpolation of bilinear operators by the polygons methods. We prove an interpolation theorem of type into spaces, and show the optimality of the precedings results.
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 Capacity Shortest...
This article deals with K- and J-spaces defined by means of polygons. First we establish some reiteration formulae involving the real method, and then we study the behaviour of weakly compact operators. We also show optimality of the weak compactness results.
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 Capacity...
Page 1