Transportation networks with random arc capacities
P. Doulliez, E. Jamoulle (1972)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
P. Doulliez, E. Jamoulle (1972)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Maciej M. Syslo (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Guo, Qin, Luo, Mingxing, Li, Lixiang, Yang, Yixian (2010)
Mathematical Problems in Engineering
Similarity:
Dong, Chengdong (2010)
Mathematical Problems in Engineering
Similarity:
Daduna, Hans (1991)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Lim, J.-T., Meerkov, S.M. (1996)
Mathematical Problems in Engineering
Similarity:
Xiangjie Kong, Yu Qi, Xiumiao Song, Guojiang Shen (2011)
Computer Science and Information Systems
Similarity:
Alfred Aanu Akinsete (2001)
Kragujevac Journal of Mathematics
Similarity:
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...
Dimiter Ivanchev (1995)
The Yugoslav Journal of Operations Research
Similarity:
Michal Przewozniczek, Krzysztof Walkowiak (2006)
International Journal of Applied Mathematics and Computer Science
Similarity:
The main objective of this paper is to develop an effective evolutionary algorithm (EA) for the path-assignment problem in survivable connection-oriented networks. We assume a single-link failure scenario, which is the most common and frequently reported failure event. Since the network flow is modeled as a non-bifurcated multicommodity flow, the discussed optimization problem is NP-complete. Thus, we develop an effective heuristic algorithm based on an evolutionary algorithm. The main...