Zobrazeno 1 - 10
of 165
pro vyhledávání: '"Robledo Franco"'
Publikováno v:
Yugoslav Journal of Operations Research, Vol 27, Iss 4, Pp 427-438 (2017)
This article presents an integer linear model for the hop constrained node survivable network design problem. The formulation is focused on networks represented by undirected graphs with not rooted demands, considering costs in arcs and in optional (
Externí odkaz:
https://doaj.org/article/f46ee30487e7455fb6286602e5005b60
Publikováno v:
Yugoslav Journal of Operations Research, Vol 27, Iss 3, Pp 341-366 (2017)
In this paper, we address the problem of network design with redundant connections, often faced by operators of telephone and internet services. The network connects customers with one master node and is built by taking into account the rules that sh
Externí odkaz:
https://doaj.org/article/8fb8294c3d9b44acb0e097addfdf14b8
Publikováno v:
Yugoslav Journal of Operations Research, Vol 26, Iss 1, Pp 17-32 (2016)
We are given a graph G = (V, E), terminal set K V and diameter d > 0. Links fail stochastically and independently with known probabilities. The diameter-constrained reliability (DCR for short), is the probability that the K-diameter is not gre
Externí odkaz:
https://doaj.org/article/98803cdc979b4aa69ecab7e0c6c490a6
Publikováno v:
Yugoslav Journal of Operations Research, Vol 26, Iss 3, Pp 343-360 (2016)
The goal of this work is to design a minimum cost resilient overlay network, where a data network is on top of a transport network. Two major challenges are addressed. On one hand, a single failure in the transport network causes multiple simultan
Externí odkaz:
https://doaj.org/article/995951d584a44fce872ecc9c567c63d2
There is a vast literature focused on network reliability evaluation. In the last decades, reliability optimization has been also addressed. Frank Boesch in 1986 introduced the concept of uniformly most reliable graph (UMRG). Later, Boesch \emph{et a
Externí odkaz:
http://arxiv.org/abs/2012.04738
The operation of a system, such as a vehicle, communication network or automatic process, heavily depends on the correct operation of its components. A Stochastic Binary System (SBS) mathematically models the behavior of on-off systems, where the com
Externí odkaz:
http://arxiv.org/abs/2011.02027
Publikováno v:
In Procedia Computer Science 2023 220:226-234
Publikováno v:
In Operations Research Perspectives 2021 8
Autor:
Burgos, Juan Manuel, Robledo, Franco
Publikováno v:
Discrete Applied Mathematics, Elsevier, Volume 198, 10 January 2016
A new general all terminal network reliability factorization theorem is stated. We relegate the proof to a forthcoming second part paper.
Externí odkaz:
http://arxiv.org/abs/1305.0972
Autor:
Sartor, Pablo, Robledo, Franco
Publikováno v:
N° RR-8267 (2013)
Consider a set of terminal nodes K that belong to a network whose nodes are connected by links that fail independently with known probabilities. We introduce a method for estimating any performability measure that depends on the hop distance between
Externí odkaz:
http://arxiv.org/abs/1303.5302