Minimal Cut Sets for Transportation System

Mihova, Marija and Maksimova, Natasha (2010) Minimal Cut Sets for Transportation System. In: Proceedings of the Seventh Conference on Informatics and Information Technology. Institute of Informatics, Faculty of Natural Sciences and Mathematics, Ss. Cyril and Methodius University in Skopje, Macedonia, Skopje, Macedonia, pp. 188-193. ISBN 978-9989-668-88-3

[img]
Preview
Text
978-9989-668-88-3_pp188-193.pdf

Download (447kB) | Preview
Official URL: http://ciit.finki.ukim.mk

Abstract

One of the most significant problems in the analysis of the reliability of multi-state transportation systems is to find the minimal path and minimal cut vectors. For that purpose there are proposed several algorithms that use the minimal path and cut sets of such systems. In this paper we give an approach to determine the minimal cut vectors. This approach directly finds all minimal cut sets. Also we will give an optimization of the basic idea, as a result of which, we will not get a candidates for minimal path sets, which actually are not a minimal cut sets.

Item Type: Book Section
Subjects: International Conference on Informatics and Information Technologies > Theoretical Aspects of Informatics
Depositing User: Vangel Ajanovski
Date Deposited: 28 Oct 2016 00:15
Last Modified: 28 Oct 2016 00:15
URI: http://eprints.finki.ukim.mk/id/eprint/11188

Actions (login required)

View Item View Item