An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
Year of publication: |
December 2016
|
---|---|
Authors: | El Khadiri, Mohamed ; Yeh, W.-C. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 76.2016, p. 22-32
|
Subject: | Arc capacity | Arc lead time | Flow network | Inclusion-Exclusion | Minimal Path | Monte-Carlo simulation | Path capacity | Path lead time | Path transmission time | Quickest path | Reliability | Suchtheorie | Search theory | Terminplanung | Time scheduling | Netzplantechnik | Project network techniques | Simulation | Stochastischer Prozess | Stochastic process | Multivariate Analyse | Multivariate analysis | USA | United States | Theorie | Theory | Algorithmus | Algorithm |
-
Algorithms for the quickest path problem and the reliable quickest path problem
Calvete, Herminia I., (2012)
-
Optimal time to invest under tax exemptions
Arkin, Vadin I., (2006)
-
Quickest detection problems in the technical analysis of the financial data
Širjaev, Alʹbert N., (2002)
- More ...
-
Yeh, W.-C., (2005)
-
Deadlock prediction and avoidance for zone-control AGVS
Yeh, M.-S., (1998)
-
A Fast Algorithm for Searching All Multi-State Minimal Cuts
Yeh, W.-C., (2008)
- More ...