A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity

DOI10.1016/J.AMC.2006.05.050MaRDI QIDQ864752zbMATH OpenOpenAlexFDO

Authors Yi-Kuei Lin

Publication date 13 February 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.05.050

zbMATH Keywords

reliabilityminimal cutunreliable nodescapacity weightsystem capacitytwo-commodity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Recommendations

• System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight
• Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case.
• System performance of a two-commodity stochastic-flow network with cost attributes in terms of minimal cuts
• Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths
• Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes

Cites work

• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
• Multi-Commodity Network Flows
• Multicommodity network flows—A survey
• Multistate reliability models
• On Two Commodity Network Flows
• 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
• 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

(8)

• System performance of a two-commodity stochastic-flow network with cost attributes in terms of minimal cuts
• Measure the quality level for a supplier-demand system by a multicommodity stochastic-flow network
• System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight
• Reliability assessment of a multistate freight network for perishable merchandise with multiple suppliers and buyers
• Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case.
• Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths
• Flow constrained minimum cost flow problem
• Reliability evaluation of a multicommodity capacitated-flow network in terms of minimal pathsets

This page was built for publication: A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity

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