Full complexity analysis of the diameter-constrained reliability
Year of publication: |
September 2015
|
---|---|
Authors: | Canale, Eduardo ; Cancela, Héctor ; Robledo, Franco ; Romero, Pablo ; Sartor, Pablo |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 22.2015, 5, p. 811-821
|
Subject: | network reliability | computational complexity | diameter-constrained reliability | Monma graphs | Graphentheorie | Graph theory | Komplexe Systeme | Complex systems | Komplexitätsmanagement | Complexity management | Mathematische Optimierung | Mathematical programming |
-
On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope
Khoshkhah, Kaveh, (2018)
-
On the complexity of the FIFO stack-up problem
Gurski, Frank, (2016)
-
The maximum l-triangle k-club problem : complexity, properties, and algorithms
Almeida, Maria Teresa, (2019)
- More ...
-
On computing the 2-diameter-constrained K-reliability of networks
Canale, Eduardo, (2013)
-
On the reliability estimation of stochastic binary systems
Cancela, Héctor, (2021)
-
On the reliability estimation of stochastic binary systems
Cancela, Héctor, (2022)
- More ...