On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint

DOI10.1016/j.ejor.2005.07.015zbMath1137.90368OpenAlexW2121958403MaRDI QIDQ2432906

Yi-Kuei Lin

Publication date: 25 October 2006

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

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

zbMATH Keywords

reliabilitybudget constraintunreliable nodesmulticommodity\((\mathbf d,B)\)-MCstochastic-flow networks

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (25)

Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints ⋮ An application of incomplete pairwise comparison matrices for ranking top tennis players ⋮ ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET ⋮ Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate ⋮ Reliability assessment of a stochastic node-failure network with multiple sinks under tolerable error rate ⋮ A method to evaluate routing policy through \(p\) minimal paths for stochastic case ⋮ System reliability for quickest path problems under time threshold and budget ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ Multi-objective optimization for stochastic computer networks using NSGA-II and TOPSIS ⋮ Evaluation of network reliability for computer networks with multiple sources ⋮ Stochastic flow networks via multiple paths under time threshold and budget constraint ⋮ Stochastic computer network under accuracy rate constraint from QoS viewpoint ⋮ Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks ⋮ On transmission time through \(k\) minimal paths of a capacitated-flow network ⋮ Multistate components assignment problem with optimal network reliability subject to assignment budget ⋮ An Approximate Algorithm for the Robust Design in a Stochastic-Flow Network ⋮ Optimal resource assignment to maximize multistate network reliability for a computer network ⋮ Decision diagram based symbolic algorithm for evaluating the reliability of a multistate flow network ⋮ System Reliability Assessment throughpMinimal Paths in Stochastic Case with Backup-routing ⋮ Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks ⋮ Time version of the shortest path problem in a stochastic-flow network ⋮ Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints ⋮ Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability ⋮ Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget ⋮ Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations

Cites Work

• Unnamed Item
• Unnamed Item
• 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: On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint