A global optimization problem in series-parallel networks with maximum reliability
The contribution is part of the problem section of J. Glob. Optim. A particular combinatorial optimization problem occurring in the reliability optimization of series-parallel networks with possible ``open-mode and ``shorted-mode failures is formulated. Efficient algorithmic solutions for the special case of series-parallel networks representable by trees of depth two can be obtained by means of continuous relaxation. References to literature are given, and some open questions concerning the special and the general case of the problem are outlined.
- On maximum reliability problem in parallel-series systems with two failure modes
- The most reliable series-parallel networks
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- Reliability Optimization Problems with Multiple Constraints
- On the maximal reliable structure of series-parallel systems with failures of two types
- A global optimization algorithm for reliable network design
- On maximum reliability problem in parallel-series systems with two failure modes
- scientific article; zbMATH DE number 3878976 (Why is no real title available?)
- scientific article; zbMATH DE number 50879 (Why is no real title available?)
- An improved algorithm for finding minimum-risk 3-state-device networks
- scientific article; zbMATH DE number 1418031 (Why is no real title available?)
- Optimization of the reliability polynomial in presence of mediocre elements
- Computational Science and Its Applications – ICCSA 2004
- Exact reliability optimization for series‐parallel graphs using convex envelopes
This page was built for publication: A global optimization problem in series-parallel networks with maximum reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342906)