Show simple item record

dc.contributor.authorEscoffier, Bruno
HAL ID: 5124
dc.contributor.authorMonnot, Jérôme
HAL ID: 178759
ORCID: 0000-0002-7452-6553
dc.contributor.authorSpanjaard, Olivier
HAL ID: 14601
dc.date.accessioned2010-02-17T13:10:11Z
dc.date.available2010-02-17T13:10:11Z
dc.date.issued2008
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/3490
dc.language.isoenen
dc.subjectBipartite perfect matchingen
dc.subjectSpanning treeen
dc.subjectShortest pathen
dc.subjectInterval dataen
dc.subjectRobust optimizationen
dc.subject.ddc003en
dc.titleSome tractable instances of interval data minmax regret problemsen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenIn this paper, we provide polynomial and pseudopolynomial algorithms for classes of particular instances of interval data minmax regret graph problems. These classes are defined using a parameter that measures the distance from well-known solvable instances. Tractable cases occur when the parameter is bounded by a constant.en
dc.relation.isversionofjnlnameOperations Research Letters
dc.relation.isversionofjnlvol36en
dc.relation.isversionofjnlissue4en
dc.relation.isversionofjnldate2008-07
dc.relation.isversionofjnlpages424-429en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/j.orl.2007.12.004en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelRecherche opérationnelleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record