An O [/E/] time algorithm computing the reliability of a class of directed networks
| Year of publication: |
1984
|
|---|---|
| Authors: | Agrawal, Avinash ; Satyanarayana, A. |
| Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 32.1984, 3, p. 493-515
|
| Subject: | Netzwerkanalyse | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
On the complexity of Convex Hull Algorithms if rotational minima can be found very fast
Huckenbeck, Ulrich, (1988)
-
The cut search algorithm with arc capacities and lower bounds
Phillips, Steve, (1979)
-
Reoptimization procedures for bounded variable primal simplex network algorithms
Ali, A. Iqbal, (1986)
- More ...
-
Web 2.5 : the vision of the future needs a plan for the now
Agrawal, Avinash, (2023)
-
Society, economy and polity in modern Andhra
Satyanarayana, Adapa, (2007)
-
Andhra peasants under British rule : agrarian relations and the rural economy; 1900 - 1940
Satyanarayana, Adapa, (1990)
- More ...