A global optimization problem in series-parallel networks with maximum reliability (Q1342906)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 711749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A global optimization problem in series-parallel networks with maximum reliability |
scientific article; zbMATH DE number 711749 |
Statements
A global optimization problem in series-parallel networks with maximum reliability (English)
0 references
15 January 1995
0 references
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.
0 references
tree optimization
0 references
reliability optimization
0 references
series-parallel networks
0 references
0.8337314128875732
0 references
0.8047221302986145
0 references
0.796654999256134
0 references
0.7880392670631409
0 references
0.7843501567840576
0 references
