| Article ID: | iaor20083393 |
| Country: | Canada |
| Volume: | 2 |
| Issue: | 2 |
| Start Page Number: | 129 |
| End Page Number: | 136 |
| Publication Date: | Sep 2007 |
| Journal: | Algorithmic Operations Research |
| Authors: | Haddadi Salim, Slimani Omar |
We consider a special linear assignment problem where some tasks are grouped, and in each group the tasks are disjunctive (in the sense that at most one of them could be performed). We show this problem NP-hard. Then we present and compare two alternative decomposition based algorithms on randomly generated instances.