A global optimization problem in series-parallel networks with maximum reliability (Q1342906)

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.