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

DOI10.1016/J.AMC.2006.05.050zbMath1127.90411OpenAlexW2092915896MaRDI QIDQ864752

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) Queueing theory (aspects of probability theory) (60K25) Deterministic network models in operations research (90B10) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (2)

Flow constrained minimum cost flow problem ⋮ Reliability assessment of a multistate freight network for perishable merchandise with multiple suppliers and buyers

Cites Work

• Unnamed Item
• 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

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