System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight

DOI10.1016/j.cor.2005.11.013zbMath1185.90026OpenAlexW2017380198MaRDI QIDQ878580

Yi-Kuei Lin

Publication date: 26 April 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.11.013

zbMATH Keywords

reliabilityminimal cutunreliable nodestwo-commoditycost attributemultistate flow network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Related Items (4)

Optimal double-resource assignment for the robust design problem in multistate computer networks ⋮ Optimal Component Quality Planning in Multi-State Computer Networks ⋮ An Approximate Algorithm for the Robust Design in a Stochastic-Flow Network ⋮ Optimal double-resource assignment for a distributed multistate network

Cites Work

• Unnamed Item
• A Simple Method for Reliability Evaluation of a Communication System
• Multicommodity network flows—A survey
• Reliability evaluation of a limited-flow network in terms of minimal cutsets
• Validation of subgradient optimization
• On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
• On Two Commodity Network Flows
• On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem
• Multi-Commodity Network Flows
• Multistate reliability models
• Study on the multicommodity reliability of a capacitated-flow network
• A simple algorithm for reliability evaluation of a stochastic-flow network with node failure

This page was built for publication: System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight