A dynamic bounding algorithm for approximating multi-state two-terminal reliability
type: Item
instance of: scholarly article
title: A dynamic bounding algorithm for approximating multi-state two-terminal reliability
zbMATH Open document ID: 1189.90049
author: Chin-Chia Jane
author: Yih-Wenn Laih
published in: European Journal of Operational Research
publication date: 2010-06-11T00:00:00Z
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5720352
zbMATH Keywords: reliability
zbMATH Keywords: multi-state network
zbMATH Keywords: network flow
zbMATH Keywords: upper/lower bounds
MaRDI profile type: Publication
full work available at URL: j.ejor.2010.01.033
OpenAlex ID: W2001854852
cites work: Computational investigations of maximum flow algorithms
cites work: Reliability Evaluation of Multistate Systems with Multistate Components
cites work: Computing Network Reliability
cites work: Q5663623
cites work: Q5514188
cites work: Reliability Bounds for Multistate Systems with Multistate Components
cites work: Reliability evaluation of a limited-flow network in terms of minimal cutsets
cites work: Practical sequential bounds for approximating two-terminal reliability
cites work: A sum of disjoint products algorithm for reliability evaluation of flow networks
cites work: On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
cites work: Q3730336
cites work: A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance
cites work: A simple algorithm to search for all MCs in networks
DOI: 10.1016/J.EJOR.2010.01.033
description: scientific article; zbMATH DE number 5720352