메뉴 건너뛰기




Volumn 176, Issue 1, 2007, Pages 347-360

On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint

Author keywords

(d, B) MC; Budget constraint; Multicommodity; Reliability; Stochastic flow networks; Unreliable nodes

Indexed keywords

BUDGET CONTROL; DECISION MAKING; RANDOM PROCESSES; RELIABILITY; VECTOR QUANTIZATION;

EID: 33748982179     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.07.015     Document Type: Article
Times cited : (86)

References (26)
  • 2
    • 0032683528 scopus 로고    scopus 로고
    • A heuristic technique for generating minimal paths and cutsets of a general network
    • Al-Ghanim A.M. A heuristic technique for generating minimal paths and cutsets of a general network. Computers and Industrial Engineering 36 (1999) 45-55
    • (1999) Computers and Industrial Engineering , vol.36 , pp. 45-55
    • Al-Ghanim, A.M.1
  • 3
    • 0017938095 scopus 로고
    • Multicommodity network flows-a survey
    • Assad A.A. Multicommodity network flows-a survey. Networks 8 (1978) 37-91
    • (1978) Networks , vol.8 , pp. 37-91
    • Assad, A.A.1
  • 4
    • 0032686639 scopus 로고    scopus 로고
    • Cutest enumeration of network systems with link and node failures
    • Fard N.S., and Lee T.H. Cutest enumeration of network systems with link and node failures. Reliability Engineering and System Safety 65 (1999) 141-146
    • (1999) Reliability Engineering and System Safety , vol.65 , pp. 141-146
    • Fard, N.S.1    Lee, T.H.2
  • 6
    • 0004738244 scopus 로고
    • A suggested computation for maximal multicommodity network flows
    • Ford L.R., and Fulkerson D.R. A suggested computation for maximal multicommodity network flows. Management Science 20 (1974) 822-844
    • (1974) Management Science , vol.20 , pp. 822-844
    • Ford, L.R.1    Fulkerson, D.R.2
  • 9
    • 0000703001 scopus 로고
    • Multi-commodity network flows
    • Hu T.C. Multi-commodity network flows. Operations Research 11 (1963) 344-360
    • (1963) Operations Research , vol.11 , pp. 344-360
    • Hu, T.C.1
  • 10
    • 0027658565 scopus 로고
    • On reliability evaluation of a limited-flow network in terms of minimal cutsets
    • Jane C.C., Lin J.S., and Yuan J. On reliability evaluation of a limited-flow network in terms of minimal cutsets. IEEE Transactions on Reliability 42 (1993) 354-361
    • (1993) IEEE Transactions on Reliability , vol.42 , pp. 354-361
    • Jane, C.C.1    Lin, J.S.2    Yuan, J.3
  • 11
    • 0004790109 scopus 로고
    • On the equivalence between the node-arc and arc-chain formulations for the multi-commodity maximal flow problem
    • Jarvis J.J. On the equivalence between the node-arc and arc-chain formulations for the multi-commodity maximal flow problem. Naval Research Logistics Quarterly 16 (1969) 525-529
    • (1969) Naval Research Logistics Quarterly , vol.16 , pp. 525-529
    • Jarvis, J.J.1
  • 12
    • 33645545302 scopus 로고
    • On reliability evaluation of a capacitated-flow network in terms of minimal pathsets
    • Lin J.S., Jane C.C., and Yuan J. On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks 25 (1995) 131-138
    • (1995) Networks , vol.25 , pp. 131-138
    • Lin, J.S.1    Jane, C.C.2    Yuan, J.3
  • 13
    • 0032279568 scopus 로고    scopus 로고
    • Reliability evaluation of capacitated-flow networks with budget constraints
    • Lin J.S. Reliability evaluation of capacitated-flow networks with budget constraints. IIE Transactions 30 (1998) 1175-1180
    • (1998) IIE Transactions , vol.30 , pp. 1175-1180
    • Lin, J.S.1
  • 14
    • 0002323308 scopus 로고    scopus 로고
    • On Reliability evaluation of a stochastic-flow network in terms of minimal cuts
    • Lin Y.K. On Reliability evaluation of a stochastic-flow network in terms of minimal cuts. Journal of Chinese Institute of Industrial Engineers 18 (2001) 49-54
    • (2001) Journal of Chinese Institute of Industrial Engineers , vol.18 , pp. 49-54
    • Lin, Y.K.1
  • 15
    • 0035399518 scopus 로고    scopus 로고
    • Study on the multicommodity reliability of a capacitated-flow network
    • Lin Y.K. Study on the multicommodity reliability of a capacitated-flow network. Computers and Mathematics with Applications 42 (2001) 255-264
    • (2001) Computers and Mathematics with Applications , vol.42 , pp. 255-264
    • Lin, Y.K.1
  • 16
    • 0035502151 scopus 로고    scopus 로고
    • A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
    • Lin Y.K. A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Computers and Operations Research 28 (2001) 1277-1285
    • (2001) Computers and Operations Research , vol.28 , pp. 1277-1285
    • Lin, Y.K.1
  • 17
    • 0036133142 scopus 로고    scopus 로고
    • Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs
    • Lin Y.K. Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs. Reliability Engineering and System Safety 75 (2002) 41-46
    • (2002) Reliability Engineering and System Safety , vol.75 , pp. 41-46
    • Lin, Y.K.1
  • 18
    • 24644518894 scopus 로고    scopus 로고
    • On the multicommodity reliability for a stochastic-flow network with node failure under budget constraint
    • Lin Y.K. On the multicommodity reliability for a stochastic-flow network with node failure under budget constraint. Journal of Chinese Institute of Industrial Engineers 20 (2003) 42-48
    • (2003) Journal of Chinese Institute of Industrial Engineers , vol.20 , pp. 42-48
    • Lin, Y.K.1
  • 19
    • 0036143036 scopus 로고    scopus 로고
    • Reliability evaluation for a multi-commodity flow model under budget constraint
    • Lin Y.K. Reliability evaluation for a multi-commodity flow model under budget constraint. Journal of the Chinese Institute of Engineers 25 (2002) 109-116
    • (2002) Journal of the Chinese Institute of Engineers , vol.25 , pp. 109-116
    • Lin, Y.K.1
  • 22
    • 0029323602 scopus 로고
    • A new simple algorithm for enumerating all minimal paths and cuts of a graph
    • Shen Y. A new simple algorithm for enumerating all minimal paths and cuts of a graph. Microelectronics and Reliability 35 (1995) 973-976
    • (1995) Microelectronics and Reliability , vol.35 , pp. 973-976
    • Shen, Y.1
  • 23
  • 24
    • 0032273391 scopus 로고    scopus 로고
    • A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network
    • Yeh W.C. A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network. IEEE Transactions on Reliability 47 (1998) 436-442
    • (1998) IEEE Transactions on Reliability , vol.47 , pp. 436-442
    • Yeh, W.C.1
  • 25
    • 0035399562 scopus 로고    scopus 로고
    • A simple algorithm to search for all d-MPs with unreliable nodes
    • Yeh W.C. A simple algorithm to search for all d-MPs with unreliable nodes. Reliability Engineering and System Safety 73 (2001) 49-54
    • (2001) Reliability Engineering and System Safety , vol.73 , pp. 49-54
    • Yeh, W.C.1
  • 26
    • 0035147987 scopus 로고    scopus 로고
    • A simple approach to search for all d-MCs of a limited-flow network
    • Yeh W.C. A simple approach to search for all d-MCs of a limited-flow network. Reliability Engineering and System Safety 71 (2001) 15-19
    • (2001) Reliability Engineering and System Safety , vol.71 , pp. 15-19
    • Yeh, W.C.1


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