메뉴 건너뛰기




Volumn 45, Issue 3, 2002, Pages 260-267

Find all longer and shorter boundary duration vectors under project time and budget constraints

Author keywords

[No Author keywords available]

Indexed keywords


EID: 33845195298     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.45.260     Document Type: Article
Times cited : (3)

References (13)
  • 1
    • 0032683528 scopus 로고    scopus 로고
    • A heuristic technique for generating minimal path and cutsets of a general network
    • A.G. AM: A heuristic technique for generating minimal path and cutsets of a general network. Computers and Industrial Engineering, 30 (1999) 45-55.
    • (1999) Computers and Industrial Engineering , vol.30 , pp. 45-55
    • Am, A.G.1
  • 2
    • 0029322978 scopus 로고
    • A note on state-space decomposition methods for analyzing stochastic flow networks
    • C. Alexopoulos: A note on state-space decomposition methods for analyzing stochastic flow networks. IEEE Transactions on Reliability, 44 (1995) 354-357.
    • (1995) IEEE Transactions on Reliability , vol.44 , pp. 354-357
    • Alexopoulos, C.1
  • 8
    • 0032647860 scopus 로고    scopus 로고
    • A new algorithm in enumerating all minimal paths in a sparse network
    • K. Kobayashi and H. Yamamoto: A New Algorithm in Enumerating all Minimal Paths in a Sparse Network. Reliability Engineering and System Safety, 65 (1999) 11-15.
    • (1999) Reliability Engineering and System Safety , vol.65 , pp. 11-15
    • Kobayashi, K.1    Yamamoto, H.2
  • 9
    • 0032279568 scopus 로고    scopus 로고
    • Reliability evaluation of capacitated-flow networks with budget constraints
    • J. S. Lin: 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
  • 10
    • 0000293867 scopus 로고    scopus 로고
    • A new algorithm to generate d-minimal paths in a multi-state flow network with non-integer arc capacities
    • Y. K. Lin and J. Yuan: A new algorithm to generate d-minimal paths in a multi-state flow network with non-integer arc capacities. International Journal of Reliability, Quality and Safety Engineering, 5 (1998) 269-285.
    • (1998) International Journal of Reliability, Quality and Safety Engineering , vol.5 , pp. 269-285
    • Lin, Y.K.1    Yuan, J.2
  • 11
    • 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. Computers and Operations Research, 28-13 (2001) 1277-1285.
    • (2001) Computers and Operations Research , vol.28 , Issue.13 , pp. 1277-1285
    • Lin, Y.K.1
  • 12
    • 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. Journal of Chinese Institute of Industrial Engineers, 18-3 (2001) 49-54.
    • (2001) Journal of Chinese Institute of Industrial Engineers , vol.18 , Issue.3 , pp. 49-54
    • Lin, Y.K.1
  • 13
    • 0029323602 scopus 로고
    • A new simple algorithm fir enumerating all minimal paths and cuts of a graph
    • Y. Shen: A New Simple Algorithm fir Enumerating all Minimal Paths and Cuts of a Graph. Microelectronics and Reliability, 35-6 (1995) 973-976.
    • (1995) Microelectronics and Reliability , vol.35 , Issue.6 , pp. 973-976
    • Shen, Y.1


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