An improved algorithm for finding minimum-risk 3-state-device networks

DOI10.1080/00207169708804575MaRDI QIDQ4347173zbMATH OpenOpenAlexFDO

Authors Ch. E. Wöber, Walter J. Gutjahr

Publication date 10 November 1997

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169708804575

zbMATH Keywords

network optimization problem

Mathematics Subject Classification ID

Theory of software (68N99) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1418031
• A global optimization problem in series-parallel networks with maximum reliability
• The Minimum Risk Spanning Tree Problem
• A New Technique in Minimal Path and Cutset Evaluation
• The most reliable series-parallel networks

Cites work

• Generating binary trees by transpositions
• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3535592 (Why is no real title available?)
• The number of trees
• Uniform random generation of expressions respecting algebraic identities

Cited in

(1)

• scientific article; zbMATH DE number 1418031 (Why is no real title available?)

This page was built for publication: An improved algorithm for finding minimum-risk 3-state-device networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4347173)