✦ LIBER ✦

A Memory-efficient Bounding Algorithm for the Two-terminal Reliability Problem

✍ Scribed by Lê, Minh; Walter, Max; Weidendorfer, Josef

Book ID: 122561973
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 249 KB
Volume: 291
Category: Article
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2012.11.015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounding algorithms for two-terminal net

Bounding algorithms for two-terminal network reliability

✍ G. Thangamani 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 418 KB

An algorithm for lower reliability bound

An algorithm for lower reliability bounds of multistate two-terminal networks

✍ Satitsatian, S.; Kapur, K.C. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 251 KB

Partial factoring: an efficient algorith

Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs

✍ Feo, T.A.; Johnson, R. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 498 KB

A Practical Algorithm for Computing Mult

A Practical Algorithm for Computing Multi-State Two-Terminal Reliability

✍ Chin-Chia Jane; Yih-Wenn Laih 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 283 KB

An efficient branch-and-bound algorithm

An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem

✍ Wei-Chang Yeh 📂 Article 📅 2001 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 826 KB

In this study, the two-machine bicriteria flowshop scheduling problem is addressed. The objective is to minimize a weighted sum of total flowtime and makespan. Different branch-and-bound algorithms have already appeared in the literature for this problem. In this study, a more efficient branch-and-b

Efficient Algorithm for the Constrained

Efficient Algorithm for the Constrained Two-dimensional Cutting Stock Problem

✍ Andre R.S. Amaral; Mike Wright 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB