SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Volumn 18, Issue 2, 1988, Pages 139-147

Computational complexity of PERT problems

(1) Hagstrom, Jane N a

a UNIVERSITY OF ILLINOIS AT CHICAGO (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84987049329 PISSN: 00283045 EISSN: 10970037 Source Type: Journal
DOI: 10.1002/net.3230180206 Document Type: Article

Times cited : (140)

References (10)

1
- 0022099676
- Bounding the project completion time distribution in PERT networks
- (1985) Operations Res. , vol.33 , pp. 862-881
- Dodin¹

2
- 0003821870
- Wiley, New York
- (1977) Activity Networks
- Elmaghraby¹

3
- 0004127488
- W. H. Freeman, San Francisco
- (1979) Computers and Intractability
- Garey, M.R.¹ Johnson, D.S.²

4
- 84987042035
- Computing the probability distribution of project completion time in a PERT network. Technical report 86‐01, College of Business Administration, University of Illinois, Box 4348, Chicago 60680
- (1985)
- Hagstrom, J.N.¹

5
- 0001008059
- Shortest distance and reliability of probabilistic networks
- (1976) Comput. Operations Res. , vol.3 , pp. 347-355
- Mirchandani¹

6
- 0021432646
- Computing network reliability in time polynomial in the number of cuts
- (1984) Operations Res , vol.32 , pp. 516-526
- Provan, J.S.¹ Ball, M.O.²

7
- 84986944625
- The complexity of counting cuts and of computing the probability that a graph is connected
- (1983) SIAM Journal on Computing , vol.12 , pp. 777-788
- Provan, J.S.¹ Ball, M.O.²

8
- 0017629555
- Bounding distributions for a stochastic PERT network
- (1977) Networks , vol.7 , pp. 359-381
- Shogan, A.W.¹

9
- 49249151236
- The complexity of computing the permanent
- (1979) Theoret. Comput. Sci , vol.8 , pp. 189-201
- Valiant, L.G.¹

10
- 84986947454
- The complexity of enumeration and reliability problems
- (1979) SIAM Journal on Computing , vol.8 , pp. 410-421
- Valiant, L.G.¹

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