Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Approximate method to evaluate reliability of complex networks

From MaRDI portal
Publication:1723066
Jump to:navigation, search

DOI10.1155/2018/5967604zbMath1407.90125OpenAlexW2901317875MaRDI QIDQ1723066

Petru Caşcaval

Publication date: 19 February 2019

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/5967604



Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)


Related Items (1)

Efficient enumeration of \(d\)-minimal paths in reliability evaluation of multistate networks



Cites Work

  • Reliability Engineering
  • Network Reliability
  • Computing Network Reliability in Time Polynomial in the Number of Cuts
  • An improved algorithm for symbolic reliability analysis
  • An Improved Abraham-Method for Generating Disjoint Sums
  • A Minimizing Algorithm for Sum of Disjoint Products
  • Disjoint Products and Efficient Computation of Reliability
  • A Simple Method for Reliability Evaluation of a Communication System
  • An Improved Algorithm for Network Reliability
  • Smaller sums of disjoint products by subproduct inversion
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Approximate method to evaluate reliability of complex networks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1723066&oldid=14046080"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 07:38.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki