An improved minimal cut set algorithm

被引：0
|
作者：
机构：
来源：
Int J Qual Reliab Manage | / 2卷 / 114期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] FATRAM - CORE EFFICIENT CUT-SET ALGORITHM
    RASMUSON, DM
    MARSHALL, NH
    IEEE TRANSACTIONS ON RELIABILITY, 1978, 27 (04) : 250 - 253
  • [22] AN ALGORITHM FOR GETTING A MINIMUM CUT-SET OF A GRAPH
    ARANY, I
    LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1986, 84 : 17 - 24
  • [23] NEW ALGORITHM FOR CUT-SET MATRIX SYNTHESIS
    TOWLIATI, SY
    BROWN, DP
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1978, 305 (04): : 187 - 198
  • [24] A Relax-and-Cut algorithm for the set partitioning problem
    Cavalcante, Victor F.
    de Souza, Cid C.
    Lucena, Abilio
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (06) : 1963 - 1981
  • [25] AN OPTIMAL ALGORITHM FOR COMPUTING A BEST CUT OF A SET OF HYPERRECTANGLES
    DAMORE, F
    ROOS, T
    WIDMAYER, P
    GRAPHICS, DESIGN AND VISUALIZATION, 1993, 9 : 215 - 224
  • [26] An improved graph cut algorithm in stereo matching
    Lu, Baoli
    Sun, Liang
    Yu, Lina
    Dong, Xiaoli
    DISPLAYS, 2021, 69
  • [27] MINIMAL COST PROJECT NETWORKS - THE CUT SET PARALLEL DIFFERENCE METHOD
    WU, Y
    LI, C
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1994, 22 (04): : 401 - 407
  • [28] A Novel Multistate Minimal Cut Vectors Problem and Its Algorithm
    Hao, Zhifeng
    Yeh, Wei-Chang
    Hu, Cheng-Feng
    IEEE TRANSACTIONS ON RELIABILITY, 2019, 68 (01) : 291 - 301
  • [29] An Optimization Algorithm for Computing the Minimal Test Set of Circuits
    Lu, Changhua
    Deng, Xiaokang
    Liu, Chun
    Wang, Yong
    2008 INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY APPLICATION WORKSHOP: IITA 2008 WORKSHOPS, PROCEEDINGS, 2008, : 717 - +
  • [30] Self-stabilizing algorithm for minimal (α,β)-dominating set
    Saadi, Leila
    Benreguia, Badreddine
    Arar, Chafik
    Moumen, Hamouma
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY, 2022, 7 (02) : 81 - 94
12345