| Article ID: | iaor20022492 |
| Country: | United States |
| Volume: | 33 |
| Issue: | 3 |
| Start Page Number: | 207 |
| End Page Number: | 219 |
| Publication Date: | May 1999 |
| Journal: | Networks |
| Authors: | Paschos Vangelis Th., Murat Ccile |
We study the probabilistic longest path problem. We propose a modification strategy adapting a solution for a deterministic instance to a solution for the probabilistic one, we compute the functional associated with this strategy, and we evaluate the complexities of computing this functional and of computing the deterministic solution maximizing it.