{"entities":{"Q2325146":{"pageid":2335889,"ns":120,"title":"Item:Q2325146","lastrevid":73698933,"modified":"2026-04-14T16:57:37Z","type":"item","id":"Q2325146","labels":{"en":{"language":"en","value":"Efficient enumeration of \\(d\\)-minimal paths in reliability evaluation of multistate networks"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7102241"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$DF305CD7-BF03-4343-A9C9-995B041F2A0B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"45c91011b4e87b643964ad1d1be4fb2ea6ae2f6b","datavalue":{"value":{"text":"Efficient enumeration of \\(d\\)-minimal paths in reliability evaluation of multistate networks","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2325146$C4CAE6DA-11A8-4F63-8890-AEEA7D6B92DA","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"36fff5ea3ffb38e5770a8102d5d5d996bdeedbb1","datavalue":{"value":"1421.90038","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2325146$E1024FB4-3446-4AB7-AA1C-CCD4E3920EDC","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"a39b868821950ed6b27e2273affa5ca9fbd34787","datavalue":{"value":"10.1155/2019/4561845","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2325146$B67B39D6-B04D-4045-ABDE-DFF817AF54A4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ad55fe47d85072c16c6bce40ddbd6b1c3527bd58","datavalue":{"value":{"entity-type":"item","numeric-id":693556,"id":"Q693556"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$9BEA799B-7CAA-4A88-9541-CC848531653A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"70008e5b11565078f1f8bb8294e891d5eea67cb5","datavalue":{"value":{"entity-type":"item","numeric-id":193288,"id":"Q193288"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$10C14420-42EB-4520-A5FF-225B3FAC5E4A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f29e146d615471bcf82ec58d849157f1d642e301","datavalue":{"value":{"entity-type":"item","numeric-id":636688,"id":"Q636688"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$2C91E158-DFEA-4639-ABF6-1CB446FE1F25","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"1dec05d6eca21826ddc25d78a5bfbbb3575f964c","datavalue":{"value":{"entity-type":"item","numeric-id":86231,"id":"Q86231"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$7F4E4B8B-9FD6-47DE-9948-68AF8752C5DE","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"eee588dd98fe3d439eeb0f9a9b009c3cd6a554c1","datavalue":{"value":{"time":"+2019-09-09T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2325146$17D0B533-3039-4507-8C78-C3E22404BC03","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"1e7f3ae85616b24df99d067719a725d0f5b07dc7","datavalue":{"value":"Summary: A number of real-world complex networks can be modeled as multistate networks for performance analysis. A multistate network consists of multistate components and possesses multiple different performance levels. For such a network, reliability is concerned with the probability of the network capacity level greater than or equal to a predetermined demand level \\(d\\). One major method for multistate network reliability evaluation is using \\(d\\)-minimal paths. This paper proposes an efficient algorithm to find \\(d\\)-minimal paths. First, a new concept of qualified state vector is defined so as to fix a relatively smaller search space of \\(d\\)-minimal paths, and a sufficient and necessary condition for a qualified state vector to be \\(d\\)-minimal path is established. Then, the max-flow algorithm and the enumeration algorithm are integrated to search for \\(d\\)-minimal paths in the determined search space that is recursively divided into subspaces such that the searching efficiency can be increased as much as possible. Both analytical and numerical results show that the proposed algorithm is more efficient in finding all \\(d\\)-minimal paths. In addition, a case study related to power transmission network is performed to demonstrate the implication of network reliability.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2325146$9B9ABF0F-8768-466D-BBFF-823597B4B38A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9cf44d503e7d4771a74e60c8b165d38259abcf57","datavalue":{"value":"90B10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2325146$D8D850D7-8B1C-4857-93B2-CF0B7C14DD0A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0556c939d5f80905b689a8f78ecccbf9dd8e2697","datavalue":{"value":"05C82","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2325146$7D49B0CC-988E-4B8E-98AE-640172A3E32A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1de0493fc6f7fe4361a54e7c2f5546e4ec52adf0","datavalue":{"value":"05C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2325146$F025A2D1-2DD6-4B3F-8EBD-8D541DFC7B48","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f3a5e47548ef139717b317f83801cfef606a623d","datavalue":{"value":"05C38","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2325146$A8575561-2406-4556-B2A7-5CA8FCA6AFB9","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9bf3d438f15ee39c97ba8439324309cc0fa8ad3e","datavalue":{"value":"7102241","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2325146$5394167C-8691-4138-AC66-16FD1655F372","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$CC511905-C564-492F-BA50-AB222A0FF918","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"5b102492a0eb4eafb7bbe6bddb85dd04246f1eab","datavalue":{"value":"https://doi.org/10.1155/2019/4561845","type":"string"},"datatype":"url"},"type":"statement","id":"Q2325146$2B04697A-2F50-41A5-AC79-19DB1FE6466A","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"d4824452e00ec2d6545e0844a528a4a2669c4b3e","datavalue":{"value":"W2924421263","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2325146$19A0E332-9997-4C3B-A9AB-045E7B2218B2","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"68570500ae6adf933754bfc2bac3d9907989296c","datavalue":{"value":{"entity-type":"item","numeric-id":1674827,"id":"Q1674827"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$D44DEEC8-3DAD-435C-9367-8F295CC2F206","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"e2af7897e126a1faa18bbe025befd784267bb011","datavalue":{"value":{"entity-type":"item","numeric-id":2974245,"id":"Q2974245"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$A4C69625-2FEF-469D-994A-4BE3239AC9B2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"1adcc5f72dde0682c9edca14e8182dc3c49bbd94","datavalue":{"value":{"entity-type":"item","numeric-id":3120581,"id":"Q3120581"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$577FAD1C-988D-4961-9A2C-C1A1C9EB8826","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"776bf971d518a4f4c8df29e8c01f99f7a857e3d8","datavalue":{"value":{"entity-type":"item","numeric-id":305918,"id":"Q305918"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$57E3708B-549E-4855-A0BB-5F2CBB98E1F6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"29e48d4b70580eb22d63c98e0f5c9d18235f103d","datavalue":{"value":{"entity-type":"item","numeric-id":1737340,"id":"Q1737340"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$3BB7BDB5-1B97-4A49-B718-22D748DC7B62","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"b6cf9201a5eaee16c28ca4ffa0309ad1d9502142","datavalue":{"value":{"entity-type":"item","numeric-id":2429908,"id":"Q2429908"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$4BF03B3F-6D10-429D-A9A5-1194142CCC3F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ed504910b778813a45037fa2d3f0a86fbadd8ae3","datavalue":{"value":{"entity-type":"item","numeric-id":636690,"id":"Q636690"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$4F495D3D-65D7-4257-81EC-06CFEF562DDB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"98cdda82ef7f7a9b64b2f0b0c48479d95c8b6d40","datavalue":{"value":{"entity-type":"item","numeric-id":1723066,"id":"Q1723066"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$5D9D41CD-43C2-44BD-8B0E-C6E7AA9FAFC5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"160d9ec1a2d9d028bc1a03efc2907c3dd39f1efb","datavalue":{"value":{"entity-type":"item","numeric-id":1632875,"id":"Q1632875"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$421F68D8-336D-4DBF-A8CD-0EE807F2C2BF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"5a8194bbc6261617ed0c4795b7e99cc5720e0026","datavalue":{"value":{"entity-type":"item","numeric-id":1632872,"id":"Q1632872"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$5D133AFB-9553-48A1-A4A4-6FCFC22E499F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"245b2725c76ecb65837b8a3c7451af67a9c3a7a9","datavalue":{"value":{"entity-type":"item","numeric-id":4838203,"id":"Q4838203"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$BE0A92C2-D86C-4A7D-BA5F-7A76A30ACFD4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"c0ae2738d4af8c20fa7c3e1aa01a5ee5b3aea46c","datavalue":{"value":{"entity-type":"item","numeric-id":3372522,"id":"Q3372522"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$91198ABD-E36A-4B19-9AD3-92F0FD3E8B4F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"f48f01e4493571b740f47ae1c8decb306c0fc055","datavalue":{"value":{"entity-type":"item","numeric-id":5955966,"id":"Q5955966"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$80351EE5-6FAA-4A39-ACB5-EB43676374BF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"3544ff5c3325f5ac1e5dcd2fd92020bf1b6189fb","datavalue":{"value":{"entity-type":"item","numeric-id":3292914,"id":"Q3292914"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$A324C541-BEC1-42A5-B1C6-9ECD1D2F6A43","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"beafd09c79dfa9f43f527c7e484481f6934843d2","datavalue":{"value":{"entity-type":"item","numeric-id":3056948,"id":"Q3056948"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$F176B46C-DDA2-44F8-A933-E9B5A812B739","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"f4447b9ced285013a76635706d1f0fbce73e02f6","datavalue":{"value":{"entity-type":"item","numeric-id":1278652,"id":"Q1278652"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$D355A440-EF48-4515-9043-9CC470849FEA","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3eb5cfdf7a6a994cc80b579197557e9774cd811a","datavalue":{"value":{"entity-type":"item","numeric-id":2223237,"id":"Q2223237"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5d77e638b98a2249f5ebd180168680cfe9c6efa0","datavalue":{"value":{"amount":"+0.8831322193145752","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2325146$5C657D89-CF52-4E9D-B387-FD9BC855EF81","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"34079bfeffc16cd27d73202d176362c241152e1e","datavalue":{"value":{"entity-type":"item","numeric-id":527215,"id":"Q527215"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"01bbc48a9e6c206d6d339bd34412a4815675e9cc","datavalue":{"value":{"amount":"+0.8320904970169067","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2325146$9B98CFDB-F87F-4F09-9F35-7A4F8D230BD5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7ea0ec731312ce6bda779d03092d40492897fa21","datavalue":{"value":{"entity-type":"item","numeric-id":4838203,"id":"Q4838203"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"82cb2649b640370ff2f563a93f792a42d46ce34f","datavalue":{"value":{"amount":"+0.8221017718315125","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2325146$9EC26446-6D87-4BFC-A51F-C5D691BCED78","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8fb3a74c7f49f2e0746db6860d949968b89f3c9b","datavalue":{"value":{"entity-type":"item","numeric-id":5077460,"id":"Q5077460"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"121fce53b53c5311290ac1b9f937194a8c1b17fd","datavalue":{"value":{"amount":"+0.8108289241790771","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2325146$E599F55C-41AE-43F5-92A5-34E902D7099D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a811f924dbe95ffbccabc1b376c2c8437a261da5","datavalue":{"value":{"entity-type":"item","numeric-id":5377761,"id":"Q5377761"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d8d8f6ac3dfa15797d1859f151777dd078940344","datavalue":{"value":{"amount":"+0.8056374788284302","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2325146$CA5EE3C3-0BE4-4C50-B18A-5D6B049BD249","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"45fcd4163b5f33e6e8c784f5522d7246c0a1a61e","datavalue":{"value":{"entity-type":"item","numeric-id":57056,"id":"Q57056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2325146$D3B13BEA-6E34-4322-A161-CADE9E092D81","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Efficient enumeration of \\(d\\)-minimal paths in reliability evaluation of multistate networks","badges":[]}}}}}