Study on the multicommodity reliability of a capacitated-flow network
From MaRDI portal
Publication:5948835
DOI10.1016/S0898-1221(01)00149-3zbMath0981.90014OpenAlexW2036933014MaRDI QIDQ5948835
Publication date: 12 November 2001
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(01)00149-3
capacitated-flow networkdemandminimal pathmulticommodity maximum flow problemmulticommodity reliability
Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items (15)
Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes ⋮ A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity ⋮ System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight ⋮ System performance of a two-commodity stochastic-flow network with cost attributes in terms of minimal cuts ⋮ Overall-terminal reliability of a stochastic capacitated-flow network. ⋮ On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint ⋮ Evaluation of network reliability for computer networks with multiple sources ⋮ Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case. ⋮ An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts ⋮ Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths ⋮ Performance evaluation for a transportation system in stochastic case ⋮ Optimal resource assignment to maximize multistate network reliability for a computer network ⋮ An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method ⋮ Reliability based assignment in stochastic-flow freight network ⋮ An interactive augmented max-min MCS–RSM method for the multi-objective network reliability problem
Cites Work
- Unnamed Item
- Reliability Bounds for Multistate Systems with Multistate Components
- Multicommodity network flows—A survey
- Validation of subgradient optimization
- 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
This page was built for publication: Study on the multicommodity reliability of a capacitated-flow network
