Show simple item record

dc.contributor.authorKalaï, Rim
dc.contributor.authorVanderpooten, Daniel
dc.date.accessioned2011-04-05T12:46:06Z
dc.date.available2011-04-05T12:46:06Z
dc.date.issued2011
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/5910
dc.language.isoenen
dc.subjectuncertaintyen
dc.subjectrobustnessen
dc.subject0–1 knapsack problemen
dc.subjectmin–max (regret)en
dc.subjectcomplexityen
dc.subject.ddc003en
dc.titleThe lexicographic α-robust knapsack problemen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenThe knapsack problem is a classical combinatorial optimization problem used to model many industrial situations. The robust version of this problem was studied in the literature using a max–min or min–max regret criterion. In this paper, we show the drawbacks of such criteria and propose a new robustness approach, called lexicographic α-robustness. We show that the complexity of the lexicographic α-robust problem does not increase compared with the max–min version and present a pseudo-polynomial algorithm in the case of a bounded number of scenarios.en
dc.relation.isversionofjnlnameInternational Transactions in Operational Research
dc.relation.isversionofjnlvol18en
dc.relation.isversionofjnlissue1en
dc.relation.isversionofjnldate2011
dc.relation.isversionofjnlpages103-113en
dc.relation.isversionofdoihttp://dx.doi.org/10.1111/j.1475-3995.2010.00786.xen
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherWileyen
dc.subject.ddclabelRecherche opérationnelleen


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