The probabilistic longest path problem

dc.contributor.author	Paschos, Vangelis
dc.contributor.author	Murat, Cécile
dc.date.accessioned	2009-09-14T12:27:39Z
dc.date.available	2009-09-14T12:27:39Z
dc.date.issued	1999
dc.identifier.uri	https://basepub.dauphine.fr/handle/123456789/1587
dc.language.iso	en	en
dc.subject	Optimisation combinatoire	en
dc.subject.ddc	511	en
dc.title	The probabilistic longest path problem	en
dc.type	Article accepté pour publication ou publié
dc.description.abstracten	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.	en
dc.relation.isversionofjnlname	Networks
dc.relation.isversionofjnlvol	33	en
dc.relation.isversionofjnlissue	3	en
dc.relation.isversionofjnldate	1999
dc.relation.isversionofjnlpages	207-219	en
dc.description.sponsorshipprivate	oui	en
dc.relation.isversionofjnlpublisher	Wiley InterScience	en
dc.subject.ddclabel	Principes généraux des mathématiques	en

Files in this item

Files	Size	Format	View
There are no files associated with this item.