Show simple item record

dc.contributor.authorAissi, Hassene
dc.contributor.authorBazgan, Cristina
dc.contributor.authorVanderpooten, Daniel
dc.date.accessioned2010-03-16T09:49:02Z
dc.date.available2010-03-16T09:49:02Z
dc.date.issued2005
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/3706
dc.language.isoenen
dc.subjectComplexityen
dc.subjectNP-harden
dc.subjectMin–max regreten
dc.subjectMin–maxen
dc.subjectAssignment problemen
dc.subject.ddc511en
dc.titleComplexity of the min-max and min-max regret assignment problemsen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenThis paper investigates the complexity of the min–max and min–max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP-hard for an unbounded number of scenarios. We also show that the interval data min–max regret assignment problem is strongly NP-hard.en
dc.relation.isversionofjnlnameOperations Research Letters
dc.relation.isversionofjnlvol33en
dc.relation.isversionofjnlissue6en
dc.relation.isversionofjnldate2005-11
dc.relation.isversionofjnlpages634-640en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/j.orl.2004.12.002en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherElsevieren
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