A global optimization problem in series-parallel networks with maximum reliability
type: Item
instance of: scholarly article
title: A global optimization problem in series-parallel networks with maximum reliability
zbMATH Open document ID: 0813.90051
DOI: 10.1007/BF01096689
published in: Journal of Global Optimization
publication date: 1995-01-15T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B15
zbMATH DE Number: 711749
zbMATH Keywords: tree optimization
zbMATH Keywords: reliability optimization
zbMATH Keywords: series-parallel networks
author: Walter J. Gutjahr
MaRDI profile type: Publication
cites work: Q4944299
description: scientific article; zbMATH DE number 711749