An algorithm to generate all upper boundary points for (d, B) in terms of minimal cuts

Yi-Kuei Lin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

This paper discusses a stochastic-flow network from single-commodity case to multicommodity case. We propose a performance index, namely the probability that the upper bound of the system capacity is a given vector subject to the budget constraint, to evaluate the quality level for such a network. A simple approach based on minimal cuts is presented to generate the all upper boundary points for the demand d subject to the budget B in order to evaluate the performance index.

Original languageEnglish
Pages (from-to)1785-1791
Number of pages7
JournalComputers and Mathematics with Applications
Volume53
Issue number12
DOIs
StatePublished - 1 Jun 2007

Keywords

  • Budget constraint
  • Minimal cuts
  • Multicommodity
  • Stochastic-flow networks
  • Upper boundary points for (d, B)

Fingerprint Dive into the research topics of 'An algorithm to generate all upper boundary points for (d, B) in terms of minimal cuts'. Together they form a unique fingerprint.

Cite this