An efficient alternative to the exact evaluation of the quickest path flow network reliability problem (Q342541)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient alternative to the exact evaluation of the quickest path flow network reliability problem |
scientific article; zbMATH DE number 6654239
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient alternative to the exact evaluation of the quickest path flow network reliability problem |
scientific article; zbMATH DE number 6654239 |
Statements
An efficient alternative to the exact evaluation of the quickest path flow network reliability problem (English)
0 references
17 November 2016
0 references
arc capacity
0 references
arc lead time
0 references
flow network
0 references
inclusion-exclusion
0 references
minimal path
0 references
Monte-Carlo simulation
0 references
path capacity
0 references
path lead time
0 references
path transmission time
0 references
quickest path
0 references
reliability
0 references
0 references
0 references
0 references
0 references
0.8598245978355408
0 references
0.8368800282478333
0 references
0.8342781662940979
0 references
0.8292563557624817
0 references
0.817505955696106
0 references
