An Approximate Algorithm for the Robust Design in a Stochastic-Flow Network
From MaRDI portal
Publication:2786232
DOI10.1080/03610921003797746zbMath1201.90047OpenAlexW2061948611MaRDI QIDQ2786232
Publication date: 21 September 2010
Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610921003797746
Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (2)
Reliability Evaluation of a Multi-state Network with Multiple Sinks under Individual Accuracy Rate Constraint ⋮ System Reliability Assessment throughpMinimal Paths in Stochastic Case with Backup-routing
Cites Work
- Unnamed Item
- System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight
- On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
- A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance
- Computational Complexity of Network Reliability Analysis: An Overview
- A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
This page was built for publication: An Approximate Algorithm for the Robust Design in a Stochastic-Flow Network