• DocumentCode
    3487461
  • Title

    An ant-algorithm for the weighted minimum hitting set problem

  • Author

    Cincotti, A. ; Cutello, V. ; Pappalardo, F.

  • Author_Institution
    Dept. of Math. & Comput. Sci., Catania Univ., Italy
  • fYear
    2003
  • fDate
    24-26 April 2003
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    We present an ant-based algorithm for finding good, near optimal solutions to the weighted minimum hitting set problem. We compare our results with the ones obtained by a greedy procedure and by an ad hoc genetic algorithm.
  • Keywords
    combinatorial mathematics; evolutionary computation; minimisation; search problems; set theory; NP-complete problems; ant-based algorithm; combinatorial optimization; near optimal solutions; weighted minimum hitting set problem; Chemicals; Computer science; Emergency services; Genetic algorithms; Greedy algorithms; Mathematics; NP-complete problem; Routing; Scheduling; Virtual colonoscopy;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Swarm Intelligence Symposium, 2003. SIS '03. Proceedings of the 2003 IEEE
  • Print_ISBN
    0-7803-7914-4
  • Type

    conf

  • DOI
    10.1109/SIS.2003.1202239
  • Filename
    1202239
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3487461