The all-to-all alternative route problem
Brian Boffey (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Brian Boffey (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Guo, Qin, Luo, Mingxing, Li, Lixiang, Yang, Yixian (2010)
Mathematical Problems in Engineering
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...
Dong, Chengdong (2010)
Mathematical Problems in Engineering
Similarity:
J. Maublanc, D. Peyrton, A. Quilliot (2010)
RAIRO - Operations Research
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.
Lieska, Kai, Jokela, Visa-Matti, Laitinen, Erkki (2004)
Lobachevskii Journal of Mathematics
Similarity:
A. C. Garavelli, P. Pontrandolfo (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
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...
Miloš Kudělka, Šárka Zehnalová, Zdeněk Horák, Pavel Krömer, Václav Snášel (2015)
International Journal of Applied Mathematics and Computer Science
Similarity:
Many real world data and processes have a network structure and can usefully be represented as graphs. Network analysis focuses on the relations among the nodes exploring the properties of each network. We introduce a method for measuring the strength of the relationship between two nodes of a network and for their ranking. This method is applicable to all kinds of networks, including directed and weighted networks. The approach extracts dependency relations among the network's nodes...
Qingji Qian, Xuanjing Shen, Haipeng Chen (2011)
Computer Science and Information Systems
Similarity:
Naor, Joseph, Orda, Ariel, Rom, Raphael (1998)
Journal of Graph Algorithms and Applications
Similarity: