dc.contributor.author | Aissi, Hassene | |
dc.contributor.author | Bazgan, Cristina | |
dc.contributor.author | Vanderpooten, Daniel | |
dc.date.accessioned | 2010-03-16T09:49:02Z | |
dc.date.available | 2010-03-16T09:49:02Z | |
dc.date.issued | 2005 | |
dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/3706 | |
dc.language.iso | en | en |
dc.subject | Complexity | en |
dc.subject | NP-hard | en |
dc.subject | Min–max regret | en |
dc.subject | Min–max | en |
dc.subject | Assignment problem | en |
dc.subject.ddc | 511 | en |
dc.title | Complexity of the min-max and min-max regret assignment problems | en |
dc.type | Article accepté pour publication ou publié | |
dc.description.abstracten | This 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.isversionofjnlname | Operations Research Letters | |
dc.relation.isversionofjnlvol | 33 | en |
dc.relation.isversionofjnlissue | 6 | en |
dc.relation.isversionofjnldate | 2005-11 | |
dc.relation.isversionofjnlpages | 634-640 | en |
dc.relation.isversionofdoi | http://dx.doi.org/10.1016/j.orl.2004.12.002 | en |
dc.description.sponsorshipprivate | oui | en |
dc.relation.isversionofjnlpublisher | Elsevier | en |
dc.subject.ddclabel | Principes généraux des mathématiques | en |