Quasi polymatroidal flow networks.
Kochol, M. (1995)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Kochol, M. (1995)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Vassil Sgurev, Mariana Nikolova (1997)
The Yugoslav Journal of Operations Research
Similarity:
Vassil Sgurev, Atanas T. Atanassov (1998)
The Yugoslav Journal of Operations Research
Similarity:
B. Gabutti, A. Ostanello-Borreani (1974)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Adrian Deaconu (2008)
The Yugoslav Journal of Operations Research
Similarity:
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.
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...
Krzysztof Walkowiak (2002)
International Journal of Applied Mathematics and Computer Science
Similarity:
Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence on network restoration are examined. A new problem of Backup Virtual Path Routing is presented...
Adrian Deaconu (2008)
RAIRO - Operations Research
Similarity:
The problem is to modify the capacities of the arcs from a network so that a given feasible flow becomes a maximum flow and the maximum change of the capacities on arcs is minimum. A very fast ⋅log()) time complexity algorithm for solving this problem is presented, where is the number of arcs and is the number of nodes of the network. The case when both, lower and upper bounds of the flow can be modified so that the given feasible flow becomes a maximum flow is also discussed. The...