-
1
-
-
0020140197
-
Capacity consideration in reliability analysis of communication systems
-
Aggarwal, K. K., Chopra, Y. C., and Bajwa, J. S., 1982. Capacity consideration in reliability analysis of communication systems. IEEE Trans. Reliability, 31:177–180.
-
(1982)
IEEE Trans. Reliability
, vol.31
, pp. 177-180
-
-
Aggarwal, K.K.1
Chopra, Y.C.2
Bajwa, J.S.3
-
2
-
-
0032683528
-
A heuristic technique for generating minimal paths and cutsets of a general network
-
Al-Ghanim, A. M., 1999. A heuristic technique for generating minimal paths and cutsets of a general network. Computers and Industrial Engineering, 36:45–55.
-
(1999)
Computers and Industrial Engineering
, vol.36
, pp. 45-55
-
-
Al-Ghanim, A.M.1
-
3
-
-
0007850062
-
Optimal multicommodity network flows with resource allocation
-
Cremeans, J. E., Smith, R. A., and Tyndall, G. R., 1970. Optimal multicommodity network flows with resource allocation. Naval Research Logistics Quarterly, 17:269–279.
-
(1970)
Naval Research Logistics Quarterly
, vol.17
, pp. 269-279
-
-
Cremeans, J.E.1
Smith, R.A.2
Tyndall, G.R.3
-
4
-
-
0007862033
-
A combinatorial equivalence between a class of multicommodity flow problems and the capacitated transportation problem
-
Evans, J. R., 1976. A combinatorial equivalence between a class of multicommodity flow problems and the capacitated transportation problem. Mathematical Programming, 10:401–404.
-
(1976)
Mathematical Programming
, vol.10
, pp. 401-404
-
-
Evans, J.R.1
-
5
-
-
84957946170
-
-
Princeton, New Jersey: Princeton University Press
-
Ford, L. R., and Fulkerson, D. R., 1962. Flows in networks Princeton, New Jersey:Princeton University Press.
-
(1962)
Flows in networks
-
-
Ford, L.R.1
Fulkerson, D.R.2
-
7
-
-
0021787852
-
Reliability bounds for multistate systems with multistate components
-
Hudson, J. C., and Kapur, K. C., 1985. Reliability bounds for multistate systems with multistate components. Operations Research, 33:153–160.
-
(1985)
Operations Research
, vol.33
, pp. 153-160
-
-
Hudson, J.C.1
Kapur, K.C.2
-
8
-
-
0007862035
-
Solving multicommodity transportation problems using a primal partitioning simplex technique
-
Kennington, J. L., 1977. Solving multicommodity transportation problems using a primal partitioning simplex technique. Naval Research Logistics Quarterly, 24:309–325.
-
(1977)
Naval Research Logistics Quarterly
, vol.24
, pp. 309-325
-
-
Kennington, J.L.1
-
9
-
-
0032647860
-
A new algorithm in enumerating all minimal paths in a sparse network
-
Kobayashi, K., and Yamamoto, H., 1999. A new algorithm in enumerating all minimal paths in a sparse network. Reliability Engineering and System Safety, 65:11–15.
-
(1999)
Reliability Engineering and System Safety
, vol.65
, pp. 11-15
-
-
Kobayashi, K.1
Yamamoto, H.2
-
10
-
-
0027148095
-
Determination of minimal upper paths for reliability analysis of planar flow networks
-
Lee, D. W., and Yum, B. J., 1993. Determination of minimal upper paths for reliability analysis of planar flow networks. Reliability Engineering & System Safety, 39:1–10.
-
(1993)
Reliability Engineering & System Safety
, vol.39
, pp. 1-10
-
-
Lee, D.W.1
Yum, B.J.2
-
11
-
-
33645545302
-
On reliability evaluation of a capacitated-flow network in terms of minimal pathsets
-
Lin, J. S., Jane, C. C., and Yuan, J., 1995. On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks, 25:131–138.
-
(1995)
Networks
, vol.25
, pp. 131-138
-
-
Lin, J.S.1
Jane, C.C.2
Yuan, J.3
-
12
-
-
0002323308
-
On Reliability Evaluation of a Stochastic-Flow Network in Terms of Minimal Cuts
-
Lin, Y. K., 2001. On Reliability Evaluation of a Stochastic-Flow Network in Terms of Minimal Cuts. Journal of Chinese Institute of Industrial Engineers, 18:49–54.
-
(2001)
Journal of Chinese Institute of Industrial Engineers
, vol.18
, pp. 49-54
-
-
Lin, Y.K.1
-
13
-
-
0035502151
-
A Simple Algorithm for Reliability Evaluation of a Stochastic-Flow Network with Node Failure
-
Lin, Y. K., 2001. A Simple Algorithm for Reliability Evaluation of a Stochastic-Flow Network with Node Failure. Computers and Operations Research, 28 (13):1277–1285.
-
(2001)
Computers and Operations Research
, vol.28
, Issue.13
, pp. 1277-1285
-
-
Lin, Y.K.1
-
14
-
-
0000293867
-
A new algorithm to generate d-minimal paths in a multistate flow network with noninteger arc capacities
-
Lin, Y. K., and Yuan, J., 1998. A new algorithm to generate d-minimal paths in a multistate flow network with noninteger arc capacities. Int. J. Reliability, Quality, and Safety Engineering, 5:269–285.
-
(1998)
Int. J. Reliability, Quality, and Safety Engineering
, vol.5
, pp. 269-285
-
-
Lin, Y.K.1
Yuan, J.2
-
15
-
-
0022921336
-
Reliability analysis of networks with capacity-constraints and failures at branches and nodes
-
Rueger, W. J., 1986. Reliability analysis of networks with capacity-constraints and failures at branches and nodes. IEEE Trans. Reliability, 35:523–528.
-
(1986)
IEEE Trans. Reliability
, vol.35
, pp. 523-528
-
-
Rueger, W.J.1
-
16
-
-
0029323602
-
A new simple algorithm for enumerating all minimal paths and cuts of a graph
-
Shen, Y., 1995. A new simple algorithm for enumerating all minimal paths and cuts of a graph. Microelectronics and Reliability, 35:973–976.
-
(1995)
Microelectronics and Reliability
, vol.35
, pp. 973-976
-
-
Shen, Y.1
-
17
-
-
0026136648
-
CAREL: Computer aided reliability evaluation for distributed computing networks
-
Soh, S., and Rai, S., 1991. CAREL:Computer aided reliability evaluation for distributed computing networks. IEEE Trans. Parallel & Distributed Systems, 2:199–213.
-
(1991)
IEEE Trans. Parallel & Distributed Systems
, vol.2
, pp. 199-213
-
-
Soh, S.1
Rai, S.2
-
18
-
-
0002030158
-
Minimum-cost multicommodity network flows
-
Tomlin, J. A., 1966. Minimum-cost multicommodity network flows. Operations Research, 14:45–51.
-
(1966)
Operations Research
, vol.14
, pp. 45-51
-
-
Tomlin, J.A.1
-
19
-
-
0002125834
-
The multicommodity network flow model revised to include vehicle per time period and node constraints
-
Weigel, H. S., and Cremeans, J. E., 1972. The multicommodity network flow model revised to include vehicle per time period and node constraints. Naval Research Logistics Quarterly, 19:77–89.
-
(1972)
Naval Research Logistics Quarterly
, vol.19
, pp. 77-89
-
-
Weigel, H.S.1
Cremeans, J.E.2
-
20
-
-
0022137745
-
On multistate system analysis
-
Xue, J., 1985. On multistate system analysis. IEEE Trans. Reliability, 34:329–337.
-
(1985)
IEEE Trans. Reliability
, vol.34
, pp. 329-337
-
-
Xue, J.1
-
21
-
-
0032273391
-
A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network
-
Yeh, W. C., 1998. A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network. IEEE Transactions on Reliability, 47:436–442.
-
(1998)
IEEE Transactions on Reliability
, vol.47
, pp. 436-442
-
-
Yeh, W.C.1
-
22
-
-
0035399562
-
A simple algorithm to search for all d-MPs with unreliable nodes
-
Yeh, W. C., 2001. A simple algorithm to search for all d-MPs with unreliable nodes. Reliability Engineering & System Safety, 73:49–54.
-
(2001)
Reliability Engineering & System Safety
, vol.73
, pp. 49-54
-
-
Yeh, W.C.1
|