Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/48333
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Silva, Jaime | - |
dc.contributor.author | Gomes, Teresa | - |
dc.contributor.author | Tipper, David | - |
dc.contributor.author | Martins, Lúcia | - |
dc.contributor.author | Kounev, Velin | - |
dc.date.accessioned | 2018-04-16T12:25:57Z | - |
dc.date.issued | 2015 | - |
dc.identifier.issn | 0028-3045 | pt |
dc.identifier.uri | https://hdl.handle.net/10316/48333 | - |
dc.description | An effective algorithm for computing all-terminal reliability bounds | pt |
dc.description.abstract | The exact calculation of all‐terminal reliability is not feasible in large networks. Hence estimation techniques and lower and upper bounds for all‐terminal reliability have been utilized. Here, we propose using an ordered subset of the mincuts and an ordered subset of the minpaths to calculate an all‐terminal reliability upper and lower bound, respectively. The advantage of the proposed new approach results from the fact that it does not require the enumeration of all mincuts or all minpaths as required by other bounds. The proposed algorithm uses maximally disjoint minpaths, prior to their sequential generation, and also uses a binary decision diagram for the calculation of their union probability. The numerical results show that the proposed approach is computationally feasible, reasonably accurate and much faster than the previous version of the algorithm. This allows one to obtain tight bounds when it not possible to enumerate all mincuts or all minpaths as revealed by extensive tests on real‐world networks. | pt |
dc.description.sponsorship | The work of Jaime Silva has been supported by ICIS Project CENTRO-07- 0224-FEDER-002003. The work of Teresa Gomes and Lúcia Martins has been in part supported by the Portuguese Foundation for Science and Technology under project grant UID/MULTI/00308/2013 and ICIS Project CENTRO-07- 0224-FEDER-002003. | pt |
dc.language.iso | eng | pt |
dc.publisher | Wiley | pt |
dc.relation | ICIS Project CENTRO-07- 0224-FEDER-002003 | pt |
dc.relation | info:eu-repo/grantAgreement/FCT/5876/147388/PT | pt |
dc.rights | openAccess | pt |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | pt |
dc.subject | all-terminal network reliability | pt |
dc.subject | network availability | pt |
dc.subject | binary decision diagram (BDD) | pt |
dc.subject | sum of disjoint products | pt |
dc.subject | bounds computation | pt |
dc.title | An effective algorithm for computing all-terminal reliability bounds | pt |
dc.type | article | - |
degois.publication.firstPage | 282 | pt |
degois.publication.lastPage | 295 | pt |
degois.publication.issue | 4 | pt |
degois.publication.title | Networks | pt |
dc.relation.publisherversion | https://onlinelibrary.wiley.com/doi/abs/10.1002/net.21634 | pt |
dc.peerreviewed | yes | pt |
dc.identifier.doi | 10.1002/net.21634 | pt |
degois.publication.volume | 66 | pt |
dc.date.embargo | 2015-01-01 | * |
uc.date.periodoEmbargo | 0 | pt |
item.fulltext | Com Texto completo | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairetype | article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.author.researchunit | CMUC - Centre for Mathematics of the University of Coimbra | - |
crisitem.author.researchunit | INESC Coimbra – Institute for Systems Engineering and Computers at Coimbra | - |
crisitem.author.researchunit | INESC Coimbra – Institute for Systems Engineering and Computers at Coimbra | - |
crisitem.author.orcid | 0000-0003-4467-7366 | - |
crisitem.author.orcid | 0000-0002-3084-5608 | - |
crisitem.author.orcid | 0000-0002-6534-0159 | - |
Appears in Collections: | I&D INESCC - Artigos em Revistas Internacionais FCTUC Eng.Electrotécnica - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
article_networks_Silva_Gomes_Tipper_Martins_Kounev_EstudoGeral.pdf | 546.07 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
25
checked on Sep 23, 2024
WEB OF SCIENCETM
Citations
18
checked on Oct 2, 2024
Page view(s) 20
705
checked on Oct 1, 2024
Download(s)
604
checked on Oct 1, 2024
Google ScholarTM
Check
Altmetric
Altmetric
This item is licensed under a Creative Commons License