On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
From MaRDI portal
Publication:2432906
DOI10.1016/J.EJOR.2005.07.015zbMATH Open1137.90368OpenAlexW2121958403MaRDI QIDQ2432906FDOQ2432906
Authors: 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
Recommendations
- Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes
- 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
- MC-based algorithm for a telecommunication network under node and budget constraints
- System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight
reliabilitybudget constraintunreliable nodesmulticommodity\((\mathbf d,B)\)-MCstochastic-flow networks
Reliability, availability, maintenance, inspection in operations research (90B25) Stochastic network models in operations research (90B15)
Cites Work
- Validation of subgradient optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multi-Commodity Network Flows
- Multicommodity network flows—A survey
- Reliability evaluation of a limited-flow network in terms of minimal cutsets
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
- On Two Commodity Network Flows
- Multistate reliability models
- A Simple Method for Reliability Evaluation of a Communication System
- On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem
- Study on the multicommodity reliability of a capacitated-flow network
Cited In (31)
- Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget
- Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
- An approximate algorithm for the robust design in a stochastic-flow network
- Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
- Estimated and accurate system reliabilities of a maintainable computer network subject to maintenance budget
- Optimal resource assignment to maximize multistate network reliability for a computer network
- Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints
- Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes
- An application of incomplete pairwise comparison matrices for ranking top tennis players
- System reliability for quickest path problems under time threshold and budget
- 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
- Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability
- Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate
- Decision diagram based symbolic algorithm for evaluating the reliability of a multistate flow network
- Mean‐standard deviation model for minimum cost flow problem
- MC-based algorithm for a telecommunication network under node and budget constraints
- Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths
- Multi-objective optimization for stochastic computer networks using NSGA-II and TOPSIS
- Measure the quality level for a supplier-demand system by a multicommodity stochastic-flow network
- Stochastic computer network under accuracy rate constraint from QoS viewpoint
- Multistate components assignment problem with optimal network reliability subject to assignment budget
- Time version of the shortest path problem in a stochastic-flow network
- A method to evaluate routing policy through \(p\) minimal paths for stochastic case
- On transmission time through \(k\) minimal paths of a capacitated-flow network
- Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations
- Stochastic flow networks via multiple paths under time threshold and budget constraint
- Reliability assessment of a stochastic node-failure network with multiple sinks under tolerable error rate
- Evaluation of network reliability for computer networks with multiple sources
- Study on multi-objective optimization of flow allocation in a multi-commodity stochastic-flow network with unreliable nodes
- Unreliability evaluation for a limited-flow network with failed nodes subject to the budget constraint
This page was built for publication: On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432906)
