A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance
From MaRDI portal
Publication:3372522
DOI10.1057/palgrave.jors.2601951zbMath1081.90025OpenAlexW2064881562MaRDI QIDQ3372522
No author found.
Publication date: 21 February 2006
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601951
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (11)
Assessing the reliability of a multistate logistics network under the transportation cost constraint ⋮ Networked dynamical systems 2016 ⋮ A minimal path-based method for computing multistate network reliability ⋮ Evaluating the reliability of a novel deterioration-effect multi-state flow network ⋮ A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network ⋮ Reliability evaluation of multi-state systems under cost consideration ⋮ Performance evaluation for a transportation system in stochastic case ⋮ A dynamic bounding algorithm for approximating multi-state two-terminal reliability ⋮ An Approximate Algorithm for the Robust Design in a Stochastic-Flow Network ⋮ An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method ⋮ Efficient enumeration of \(d\)-minimal paths in reliability evaluation of multistate networks
This page was built for publication: A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance
