Skip to main content

2003 | OriginalPaper | Buchkapitel

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

verfasst von : Vincenzo Cutello, Francesco Pappalardo

Erschienen in: Genetic and Evolutionary Computation — GECCO 2003

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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).

Metadaten
Titel
The Hitting Set Problem and Evolutionary Algorithmic Techniques with ad-hoc Viruses (HEAT-V)
verfasst von
Vincenzo Cutello
Francesco Pappalardo
Copyright-Jahr
2003
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/3-540-45110-2_29

Neuer Inhalt