System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight
type: Item
instance of: scholarly article
title: System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight
zbMATH Open document ID: 1185.90026
author: Yi-Kuei Lin
published in: Computers \& Operations Research
publication date: 2007-04-26T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5146804
zbMATH Keywords: reliability
zbMATH Keywords: two-commodity
zbMATH Keywords: multistate flow network
zbMATH Keywords: unreliable nodes
zbMATH Keywords: cost attribute
zbMATH Keywords: minimal cut
MaRDI profile type: Publication
full work available at URL: j.cor.2005.11.013
OpenAlex ID: W2017380198
cites work: A Simple Method for Reliability Evaluation of a Communication System
cites work: On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
cites work: A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
cites work: Q5514188
cites work: Reliability evaluation of a limited-flow network in terms of minimal cutsets
cites work: Multicommodity network flows—A survey
cites work: Validation of subgradient optimization
cites work: Multi-Commodity Network Flows
cites work: On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem
cites work: On Two Commodity Network Flows
cites work: Multistate reliability models
cites work: Study on the multicommodity reliability of a capacitated-flow network
DOI: 10.1016/J.COR.2005.11.013
description: scientific article; zbMATH DE number 5146804