Show simple item record

dc.contributor.authorPaschos, Vangelis
dc.contributor.authorMurat, Cécile
dc.date.accessioned2009-09-14T12:27:39Z
dc.date.available2009-09-14T12:27:39Z
dc.date.issued1999
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/1587
dc.language.isoenen
dc.subjectOptimisation combinatoireen
dc.subject.ddc511en
dc.titleThe probabilistic longest path problemen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenWe 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.en
dc.relation.isversionofjnlnameNetworks
dc.relation.isversionofjnlvol33en
dc.relation.isversionofjnlissue3en
dc.relation.isversionofjnldate1999
dc.relation.isversionofjnlpages207-219en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherWiley InterScienceen
dc.subject.ddclabelPrincipes généraux des mathématiquesen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record