论文信息 - The Hitting Set Problem and Evolutionary Algorithmic Techniques with ad-hoc Viruses (HEAT-V)

The Hitting Set Problem and Evolutionary Algorithmic Techniques with ad-hoc Viruses (HEAT-V)

The Weighted Minimum Hitting Set Problem (WMHSP) and the standard Minimum Hitting Set Problem (MHSP), are combinatorial problems of great interest for many applications. Although, these problems lend themselves quite naturally to an evolutionary approach. To our knowledge, there are no significant results of evolutionary algorithms applied to either the WMHSP or the MHSP, except for the results contained in Cutello et al., (2002).

Vincenzo Cutello | Francesco Pappalardo

[1] William J. Cook,et al. Combinatorial optimization , 1997 .

[2] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[3] Vincenzo Cutello,et al. An evolutionary algorithm for the T-constrained variation of Minimum Hitting Set problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).