Article ID: | iaor20082039 |
Country: | Netherlands |
Volume: | 35 |
Issue: | 2 |
Start Page Number: | 205 |
End Page Number: | 210 |
Publication Date: | Mar 2007 |
Journal: | Operations Research Letters |
Authors: | Croce Federico Della, Paschos Vangelis Th., Escoffier Bruno |
Keywords: | programming: integer, location |
We consider MIN SET COVERING when the subsets are constrained to have maximum cardinality 3. We propose an exact algorithm whose worst-case complexity is bounded above by O*(1.3957