dc.contributor.author | Murat, Cécile | |
dc.contributor.author | Paschos, Vangelis | |
dc.date.accessioned | 2011-03-22T09:23:00Z | |
dc.date.available | 2011-03-22T09:23:00Z | |
dc.date.issued | 1998 | |
dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/5780 | |
dc.description | LNOR n°3, p.256-267 | en |
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 | Communication / Conférence | |
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.description.sponsorshipprivate | oui | en |
dc.subject.ddclabel | Principes généraux des mathématiques | en |
dc.relation.conftitle | 3rd International Symposium on Operations Research and its Applications (ISORA'98) | en |
dc.relation.confdate | 1998-08 | |
dc.relation.confcity | Kunming | en |
dc.relation.confcountry | Chine | en |