Study on the multicommodity reliability of a capacitated-flow network

Computers and Mathematics with Applications

Volumn 42, Issue 1-2, 2001, Pages 255-264

  Lin, Yi Kuei ^a  

^a VAN NUNG INSTITUTE OF TECHNOLOGY   (Taiwan)

Author keywords

Capacitated flow network; Demand; Minimal path; Multicommodity reliability

Indexed keywords

ALGORITHMS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SET THEORY;

CAPACITATED FLOW NETWORKS; MULTICOMMODITY MAXIMUM FLOW (MMF);

COMPUTER NETWORKS;

EID: 0035399518     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(01)00149-3     Document Type: Article

References (11)

1. Multicommodity network flows - A survey
2. A suggested computation for maximal multicommodity network flows
3. Validation of subgradient optimization
4. Multicommodity network flows
5. On the equivalence between the node-arc and arc-chain formulations for the multi-commodity maximal flow problem
6. On two commodity network flows
7. Multistate reliability models
8. Reliability bounds for multistate systems with multistate components
9. A new algorithm to generate d-minimal paths in a multistate flow network with noninteger arc capacities
10. On reliability evaluation of a stochastic-flow network in terms of minimal cuts