A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in Directed Acyclic Graphs and reliability
Résumé
The paper studies the expectation of the inspection time in complex aging systems , i.e. the length of the shortest path in a Directed Acyclic Graph, with random costs on egdes. We give a lower bound for this expectation.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...