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

DOI10.1016/j.camwa.2006.05.025zbMath1135.90310OpenAlexW2060631552MaRDI QIDQ2458722

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

minimal cutsbudget constraintmulticommoditystochastic-flow networksupper boundary points for \((\mathbf d,B)\)

Mathematics Subject Classification ID

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

Cites Work

• Multicommodity network flows—A survey
• Reliability evaluation of a limited-flow network in terms of minimal cutsets
• Validation of subgradient optimization
• On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
• On Two Commodity Network Flows
• On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem
• Multi-Commodity Network Flows
• Multistate reliability models
• Study on the multicommodity reliability of a capacitated-flow network
• A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
• Unnamed Item

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