• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

The probabilistic longest path problem

Thumbnail
Date
1999
Dewey
Principes généraux des mathématiques
Sujet
Optimisation combinatoire
Journal issue
Networks
Volume
33
Number
3
Publication date
1999
Article pages
207-219
Publisher
Wiley InterScience
URI
https://basepub.dauphine.fr/handle/123456789/1587
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Paschos, Vangelis
Murat, Cécile
Type
Article accepté pour publication ou publié
Abstract (EN)
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.