论文信息 - Effective heuristics for the Set Covering with Pairs Problem

Effective heuristics for the Set Covering with Pairs Problem

This paper deals with the Set Covering with Pairs Problem (SCPP). This problem is a generalization of the Set Covering Problem (SCP), which is known to be NP-hard. The difference between the problems is that, in the SCPP, one element of the universe is admitted to be covered if there are at least two specific objects chosen to cover it. In this context, three constructive heuristics, one local search algorithm and a Greedy Randomized Adaptive Search Procedure are proposed. The algorithms developed were tested in 560 instances available in the literature and they were capable of achieving optimal solutions for several instances.

[1] Alexander Russell,et al. Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping , 2006, International Conference on Computational Science.

[2] Refael Hassin,et al. The Set Cover with Pairs Problem , 2005, FSTTCS.

[3] Steven Skiena,et al. Microarray synthesis through multiple-use PCR primer design , 2002, ISMB.

[4] Martine Labbé,et al. The pure parsimony haplotyping problem: overview and computational advances , 2009, Int. Trans. Oper. Res..

[5] Dror Rawitz,et al. The Minimum Substring Cover problem , 2008, Inf. Comput..

[6] Celso C. Ribeiro,et al. GRASP with Path-Relinking: Recent Advances and Applications , 2005 .

[7] Dan Gusfield,et al. Haplotype Inference by Pure Parsimony , 2003, CPM.

[8] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[9] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..