메뉴 건너뛰기




Volumn 91, Issue 5, 2006, Pages 539-545

Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts

Author keywords

Budget constraint; Minimal cut; Performance index; Stochastic flow network; System reliability

Indexed keywords

ALGORITHMS; BENCHMARKING; BOUNDARY CONDITIONS; BUDGET CONTROL; CONSTRAINT THEORY; COST ACCOUNTING; FAILURE ANALYSIS; PROBABILITY; PROBLEM SOLVING; RELIABILITY;

EID: 31544472849     PISSN: 09518320     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ress.2005.03.018     Document Type: Article
Times cited : (41)

References (28)
  • 1
    • 0018455846 scopus 로고
    • An improved algorithm for network reliability
    • J.A. Abraham An improved algorithm for network reliability IEEE Trans Reliab 28 1979 58 61
    • (1979) IEEE Trans Reliab , vol.28 , pp. 58-61
    • Abraham, J.A.1
  • 2
    • 0018003124 scopus 로고
    • Symbolic reliability evaluation using logical signal relations
    • K.K. Aggarwal, and S. Rai Symbolic reliability evaluation using logical signal relations IEEE Trans Reliab R-27 1978 202 205
    • (1978) IEEE Trans Reliab , vol.R-27 , pp. 202-205
    • Aggarwal, K.K.1    Rai, S.2
  • 3
    • 0020140197 scopus 로고
    • Capacity consideration in reliability analysis of communication systems
    • K.K. Aggarwal, Y.C. Chopra, and J.S. Bajwa Capacity consideration in reliability analysis of communication systems IEEE Trans Reliab 31 1982 177 180
    • (1982) IEEE Trans Reliab , vol.31 , pp. 177-180
    • Aggarwal, K.K.1    Chopra, Y.C.2    Bajwa, J.S.3
  • 4
    • 0042266794 scopus 로고    scopus 로고
    • Solving the convex cost integer dual network flow problem
    • R.K. Ahuja, D.S. Hochbaum, and J.B. Orlin Solving the convex cost integer dual network flow problem Manage Sci 49 7 2003 950 964
    • (2003) Manage Sci , vol.49 , Issue.7 , pp. 950-964
    • Ahuja, R.K.1    Hochbaum, D.S.2    Orlin, J.B.3
  • 5
    • 0032683528 scopus 로고    scopus 로고
    • A heuristic for generating minimal path and cutsets of a general network
    • A.M. Al-Ghanim A heuristic for generating minimal path and cutsets of a general network Comput Ind Eng 36 1999 45 55
    • (1999) Comput Ind Eng , vol.36 , pp. 45-55
    • Al-Ghanim, A.M.1
  • 6
    • 0020709347 scopus 로고
    • Minimum cost flow algorithms for series-parallel networks
    • W.W. Bein, P. Brucker, and Tamir Arie Minimum cost flow algorithms for series-parallel networks Discrete Appl Math 10 2 1983 117 124
    • (1983) Discrete Appl Math , vol.10 , Issue.2 , pp. 117-124
    • Bein, W.W.1    Brucker, P.2    Tamir, A.3
  • 7
    • 0020734439 scopus 로고
    • Probability flows for reliability evaluation of multiarea power system interconnections
    • D.P. Clancy, G. Gross, and F.F. Wu Probability flows for reliability evaluation of multiarea power system interconnections Electr Power Energy Syst 5 1983 100 114
    • (1983) Electr Power Energy Syst , vol.5 , pp. 100-114
    • Clancy, D.P.1    Gross, G.2    Wu, F.F.3
  • 8
    • 0036489509 scopus 로고    scopus 로고
    • An efficient network flow code for finding all minimum cost s-t cutsets
    • N.D. Curet, J. DeVinney, and M.E. Gaston An efficient network flow code for finding all minimum cost s-t cutsets Comput Oper Res 29 3 2002 205 219
    • (2002) Comput Oper Res , vol.29 , Issue.3 , pp. 205-219
    • Curet, N.D.1    Devinney, J.2    Gaston, M.E.3
  • 9
    • 0002994689 scopus 로고
    • Transportation networks with random arc capacities
    • P. Doulliez, and J. Jamoulle Transportation networks with random arc capacities RAIRO, Rech Oper Res 3 1972 45 60
    • (1972) RAIRO, Rech Oper Res , vol.3 , pp. 45-60
    • Doulliez, P.1    Jamoulle, J.2
  • 11
    • 0016947568 scopus 로고
    • Maximal flow in probabilistic graphs - The discrete case
    • J.R. Evans Maximal flow in probabilistic graphs - the discrete case Networks 6 1976 161 183
    • (1976) Networks , vol.6 , pp. 161-183
    • Evans, J.R.1
  • 12
    • 0032686639 scopus 로고    scopus 로고
    • Cutset enumeration of network systems with link and node failures
    • N.S. Fard, and T.H. Lee Cutset enumeration of network systems with link and node failures Reliab Eng Syst Saf 65 2 1999 141 146
    • (1999) Reliab Eng Syst Saf , vol.65 , Issue.2 , pp. 141-146
    • Fard, N.S.1    Lee, T.H.2
  • 14
    • 0033358232 scopus 로고    scopus 로고
    • New scaling algorithm for the minimum cost network flow problem
    • D. Goldfarb, and Z. Jin New scaling algorithm for the minimum cost network flow problem Operations Res Lett 25 5 1999 205 211
    • (1999) Operations Res Lett , vol.25 , Issue.5 , pp. 205-211
    • Goldfarb, D.1    Jin, Z.2
  • 15
    • 0000913640 scopus 로고
    • Multistate reliability models
    • W.S. Griffith Multistate reliability models J Appl Probab 17 1980 735 744
    • (1980) J Appl Probab , vol.17 , pp. 735-744
    • Griffith, W.S.1
  • 16
    • 0027658565 scopus 로고
    • On reliability evaluation of a limited-flow network in terms of minimal cutsets
    • C.C. Jane, J.S. Lin, and J. Yuan On reliability evaluation of a limited-flow network in terms of minimal cutsets IEEE Trans Reliab 42 3 1993 354 361
    • (1993) IEEE Trans Reliab , vol.42 , Issue.3 , pp. 354-361
    • Jane, C.C.1    Lin, J.S.2    Yuan, J.3
  • 17
    • 0019008077 scopus 로고
    • Reliability evaluation of a flow network
    • S.H. Lee Reliability evaluation of a flow network IEEE Trans Reliab 29 1980 24 26
    • (1980) IEEE Trans Reliab , vol.29 , pp. 24-26
    • Lee, S.H.1
  • 18
    • 0027148095 scopus 로고
    • Determination of minimal upper paths for reliability analysis of planar flow networks
    • D.W. Lee, and B.J. Yum Determination of minimal upper paths for reliability analysis of planar flow networks Reliab Eng Syst Saf 39 1993 1 10
    • (1993) Reliab Eng Syst Saf , vol.39 , pp. 1-10
    • Lee, D.W.1    Yum, B.J.2
  • 19
    • 0002323308 scopus 로고    scopus 로고
    • On Reliability evaluation of a stochastic-flow network in terms of minimal cuts
    • Y.K. Lin On Reliability evaluation of a stochastic-flow network in terms of minimal cuts J Chin Inst Ind Eng 18 3 2001 49 54
    • (2001) J Chin Inst Ind Eng , vol.18 , Issue.3 , pp. 49-54
    • Lin, Y.K.1
  • 20
    • 0035502151 scopus 로고    scopus 로고
    • A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
    • Y.K. Lin A simple algorithm for reliability evaluation of a stochastic-flow network with node failure Comput Oper Res 28 13 2001 1277 1285
    • (2001) Comput Oper Res , vol.28 , Issue.13 , pp. 1277-1285
    • Lin, Y.K.1
  • 21
    • 0037791894 scopus 로고    scopus 로고
    • Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case
    • Y.K. Lin Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case Comput Oper Res 30 11 2003 1595 1607
    • (2003) Comput Oper Res , vol.30 , Issue.11 , pp. 1595-1607
    • Lin, Y.K.1
  • 22
    • 0036832992 scopus 로고    scopus 로고
    • Two-commodity reliability evaluation for a stochastic-flow network with node failure
    • Y.K. Lin Two-commodity reliability evaluation for a stochastic-flow network with node failure Comput Oper Res 29 13 2002 1927 1939
    • (2002) Comput Oper Res , vol.29 , Issue.13 , pp. 1927-1939
    • Lin, Y.K.1
  • 23
    • 0036363774 scopus 로고    scopus 로고
    • Study on the system capacity for a multicommodity stochastic-flow network with node failure
    • Y.K. Lin Study on the system capacity for a multicommodity stochastic-flow network with node failure Reliab Eng Syst Saf 78 1 2002 57 62
    • (2002) Reliab Eng Syst Saf , vol.78 , Issue.1 , pp. 57-62
    • Lin, Y.K.1
  • 24
    • 0031077339 scopus 로고    scopus 로고
    • A parallel algorithm evaluating the reliability of a system with known minimal cuts (paths)
    • J. Malinowski, and W. Preuss A parallel algorithm evaluating the reliability of a system with known minimal cuts (paths) Microelectron Reliab 37 2 1997 255 265
    • (1997) Microelectron Reliab , vol.37 , Issue.2 , pp. 255-265
    • Malinowski, J.1    Preuss, W.2
  • 26
    • 0344466642 scopus 로고    scopus 로고
    • An O(nm2) time algorithm for solving minimal cost network flow problems
    • F.H. Salehi, and G.H. Shirdel An O(nm2) time algorithm for solving minimal cost network flow problems Asia-Pacific J Oper Res 20 2 2003 161 175
    • (2003) Asia-Pacific J Oper Res , vol.20 , Issue.2 , pp. 161-175
    • Salehi, F.H.1    Shirdel, G.H.2
  • 27
    • 0022137745 scopus 로고
    • On multistate system analysis
    • J. Xue On multistate system analysis IEEE Trans Reliab 34 1985 329 337
    • (1985) IEEE Trans Reliab , vol.34 , pp. 329-337
    • Xue, J.1
  • 28
    • 0035147987 scopus 로고    scopus 로고
    • A simple approach to search for all d-MCs of a limited-flow network
    • W.C. Yeh A simple approach to search for all d-MCs of a limited-flow network Reliab Eng Syst Saf 71 1 2001 15 19
    • (2001) Reliab Eng Syst Saf , vol.71 , Issue.1 , pp. 15-19
    • Yeh, W.C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.