Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case

@article{Lin2003UsingMC,
  title={Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case},
  author={Yi-Kuei Lin},
  journal={Computers & OR},
  year={2003},
  volume={30},
  pages={1595-1607}
}
Traditionally, the (ow network is assumed to allow a single type of commodity to transmit through it. The system capacity is the maximum value of (ow from the source to the sink. It is trivial that the system capacity is 4xed for a deterministic (ow network. However, for a stochastic-(ow network (the capacity of each arc may have several possible values), the system capacity is not 4xed. Hence, many authors proposed methods to calculate two performance indices, the probability that the system… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
7 Citations
25 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 25 references

On reliability evaluation of a stochastic-(ow network in terms of minimal cuts

  • YK Lin
  • Journal of Chinese Institute of Industrial…
  • 2001
Highly Influential
9 Excerpts

Study on the multicommodity reliability of a capacitated-(ow network. Computers and Mathematics with Applications 2001;42(2):255–64

  • YK Lin
  • 2001
Highly Influential
5 Excerpts

On reliability evaluation of a limited-(ow network in terms of minimal cutsets

  • CC Jane, JS Lin, J. Yuan
  • IEEE Transactions on Reliability
  • 1993
Highly Influential
6 Excerpts

A simple approach to search for all d-MCs of a limited-(ow network reliability. Engineering and System Safety 2001;71:15–9

  • WC Yeh
  • Operations Research
  • 2003
2 Excerpts

Study on the multicommodity reliability of a capacitated - ( ow network

  • YK Lin
  • Computers and Mathematics with Applications
  • 2001

A heuristic technique for generating minimal paths and cutsets of a general network

  • AM Al-Ghanim
  • Computers and Industrial Engineering
  • 1999

A heuristic technique for generating minimal paths and cutsets of a general network. Computers and Industrial Engineering 1999;36:45–55

  • AM Al-Ghanim
  • 1999
1 Excerpt

Similar Papers

Loading similar papers…