Abstract
Reliability and delivery cost or maintenance cost are important indicators showing the stability and the quality of operation of a multi-state flow network. Many authors developed (d,b)-minimal cut based or (d,b)-minimal path based algorithms to compute the network reliability, i.e., the probability that a demand d can be delivered from the source node to the sink node subject to the constraint that the total delivery cost (maintenance cost) is not greater than b. It is proven that contrary to prevalent methods in existing literature, both (d,b)-minimal cuts and (d,b)-minimal paths are insufficient to compute the exact value of the reliability of a multi-state flow network under budget or maintenance budget constraints. Moreover, it is also shown how this value can be determined.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
