Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes

DOI10.1016/j.ejor.2006.09.082zbMath1127.90010OpenAlexW1999617901MaRDI QIDQ2370349

Yi-Kuei Lin

Publication date: 25 June 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.09.082

zbMATH Keywords

reliabilitybudgetunreliable nodes\(p\)-commoditylimited-flow networksupper boundary vectors

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case.
• Two-commodity reliability evaluation for a stochastic-flow network with node failure
• A Simple Method for Reliability Evaluation of a Communication System
• 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: Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes