An improved algorithm for finding all upper boundary points in a stochastic-flow network

DOI10.1016/J.APM.2015.10.004MaRDI QIDQ2289333zbMATH OpenOpenAlexFDO

Authors Majid Forghani-elahabad, Nezam Mahdavi-Amiri

Publication date 28 January 2020

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2015.10.004

zbMATH Keywords

d-MinCut (\textit{d-MC})reliabilitystochastic-flow networksum of disjoint products method

Mathematics Subject Classification ID

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

Recommendations

• Search for all \(d\)-mincuts of a limited-flow network
• An algorithm of calculating the reliability of stochastic flow networks by using minimal cuts
• 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
• An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts

Cites work

• Benchmarking optimization software with performance profiles.
• Bounds for increasing multi-state consecutive \(k\)-out-of-\(r\)-from-\(n\): \(F\) system with equal components probabilities
• Computational Complexity of Network Reliability Analysis: An Overview
• scientific article; zbMATH DE number 49666 (Why is no real title available?)
• scientific article; zbMATH DE number 772852 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.
• Recent Developments in Computing of System-Reliability
• Redundant paths and reliability bounds in gamma networks
• Reliability analysis of a warm standby repairable system with priority in use
• Reliability evaluation of a limited-flow network in terms of minimal cutsets
• Reliability evaluation of multi-state systems under cost consideration
• Spare routing problem with p minimal paths for time-based stochastic flow networks
• The Complexity of Enumeration and Reliability Problems
• What Monte Carlo models can do and cannot do efficiently?

Cited in

(7)

• Search for all \(d\)-mincuts of a limited-flow network
• Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation
• Reliability evaluation of a stochastic multimodal transport network under time and budget considerations
• Hybrid flow-shop manufacturing network reliability optimization using genetic algorithm and absorbing Markov chain
• An Improved Vectorization Algorithm to Solve the d-MP Problem
• Cost-constrained reliability assessment of multistate flow networks with multiple sources
• Evaluating the reliability of a multi-state supply chain network with supply capacity and transportation emission constraints

This page was built for publication: An improved algorithm for finding all upper boundary points in a stochastic-flow network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289333)