<mods:mods version="3.3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><mods:titleInfo><mods:title>Configurations of series-parallel networks with maximum reliability</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">W.</mods:namePart><mods:namePart type="family">Gutjahr</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">G.C.</mods:namePart><mods:namePart type="family">Pflug</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">A.</mods:namePart><mods:namePart type="family">Ruszczynski</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>The optimal design problem for networks with three-state components is the following: select from a given class of networks with n components, each of which can be operative or experience an open-mode or a shorted-mode failure state, the network with maximum reliability. We present an algorithm for solving this problem in the case of two-stage series-parallel networks, i.e. networks consisting of a number of series configurations linked in parallel or vice versa. For practically relevant network sizes (up to 100 components), the algorithm is fast.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">1996-02</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>Elsevier</mods:publisher></mods:originInfo><mods:genre>Article</mods:genre></mods:mods>