IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v174y2006i3p1694-1705.html
   My bibliography  Save this article

A simple algorithm to search for all MCs in networks

Author

Listed:
  • Yeh, Wei-Chang

Abstract

No abstract is available for this item.

Suggested Citation

  • Yeh, Wei-Chang, 2006. "A simple algorithm to search for all MCs in networks," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1694-1705, November.
    • Handle: RePEc:eee:ejores:v:174:y:2006:i:3:p:1694-1705
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00251-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yeh, Wei-Chang & Tan, Shi-Yi & Zhu, Wenbo & Huang, Chia-Ling & Yang, Guang-yi, 2022. "Novel binary addition tree algorithm (BAT) for calculating the direct lower-bound of the highly reliable binary-state network reliability," Reliability Engineering and System Safety, Elsevier, vol. 223(C).
    2. Yeh, Wei-Chang, 2021. "A quick BAT for evaluating the reliability of binary-state networks," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    3. Yeh, Wei-Chang, 2020. "A new method for verifying d-MC candidates," Reliability Engineering and System Safety, Elsevier, vol. 204(C).
    4. Paweł Marcin Kozyra, 2020. "Analysis of minimal path and cut vectors in multistate monotone systems and use it for detection of binary type multistate monotone systems," Journal of Risk and Reliability, , vol. 234(5), pages 686-695, October.
    5. Yeh, Wei-Chang, 2008. "An improved algorithm for searching all minimal cuts in modified networks," Reliability Engineering and System Safety, Elsevier, vol. 93(7), pages 1018-1024.
    6. Yeh, Wei-Chang, 2021. "Novel binary-addition tree algorithm (BAT) for binary-state network reliability problem," Reliability Engineering and System Safety, Elsevier, vol. 208(C).
    7. Yeh, Wei-Chang, 2023. "QB-II for evaluating the reliability of binary-state networks," Reliability Engineering and System Safety, Elsevier, vol. 230(C).
    8. Yeh, Wei-Chang & Du, Chia-Ming & Tan, Shi-Yi & Forghani-elahabad, Majid, 2023. "Application of LSTM based on the BAT-MCS for binary-state network approximated time-dependent reliability problems," Reliability Engineering and System Safety, Elsevier, vol. 235(C).
    9. Jane, Chin-Chia & Laih, Yih-Wenn, 2010. "A dynamic bounding algorithm for approximating multi-state two-terminal reliability," European Journal of Operational Research, Elsevier, vol. 205(3), pages 625-637, September.
    10. Reed, Sean & Löfstrand, Magnus & Andrews, John, 2019. "An efficient algorithm for computing exact system and survival signatures of K-terminal network reliability," Reliability Engineering and System Safety, Elsevier, vol. 185(C), pages 429-439.
    11. Yeh, Wei-Chang, 2021. "Novel Algorithm for Computing All-Pairs Homogeneity-Arc Binary-State Undirected Network Reliability," Reliability Engineering and System Safety, Elsevier, vol. 216(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:174:y:2006:i:3:p:1694-1705. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.