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

DOI10.1016/J.CAMWA.2006.05.025MaRDI QIDQ2458722zbMATH OpenOpenAlexFDO

Authors Yi-Kuei Lin

Publication date 2 November 2007

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2006.05.025

zbMATH Keywords

budget constraintminimal cutsmulticommoditystochastic-flow networksupper boundary points for \((\mathbf d,B)\)

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Stochastic network models in operations research (90B15)

Recommendations

• System performance of a two-commodity stochastic-flow network with cost attributes in terms of minimal cuts
• Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case.
• Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes
• An algorithm of calculating the reliability of stochastic flow networks by using minimal cuts
• MC-based algorithm for a telecommunication network under node and budget constraints

Cites work

• A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• Multi-Commodity Network Flows
• Multicommodity network flows—A survey
• Multistate reliability models
• On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
• On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem
• On Two Commodity Network Flows
• Reliability evaluation of a limited-flow network in terms of minimal cutsets
• Study on the multicommodity reliability of a capacitated-flow network
• Validation of subgradient optimization

Cited in

(4)

• Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case.
• An improved algorithm for finding all upper boundary points in a stochastic-flow network
• MC-based algorithm for a telecommunication network under node and budget constraints
• System performance of a two-commodity stochastic-flow network with cost attributes in terms of minimal cuts

This page was built for publication: An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2458722)