A Comparison Between ACO Algorithms for the Set Covering Problem

Lucas Lessing, Irina Dumitrescu, Thomas Stützle. A Comparison Between ACO Algorithms for the Set Covering Problem. In Marco Dorigo, Mauro Birattari, Christian Blum, Luca Maria Gambardella, Francesco Mondada, Thomas Stützle, editors, Ant Colony Optimization and Swarm Intelligence, 4th International Workshop, ANTS 2004, Brussels, Belgium, September 5 - 8, 2004, Proceedings. Volume 3172 of Lecture Notes in Computer Science, pages 1-12, Springer, 2004. [doi]

@inproceedings{LessingDS04,
  title = {A Comparison Between ACO Algorithms for the Set Covering Problem},
  author = {Lucas Lessing and Irina Dumitrescu and Thomas Stützle},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3172&spage=1},
  researchr = {https://researchr.org/publication/LessingDS04},
  cites = {0},
  citedby = {0},
  pages = {1-12},
  booktitle = {Ant Colony Optimization and Swarm Intelligence, 4th International Workshop, ANTS 2004, Brussels, Belgium, September 5 - 8, 2004, Proceedings},
  editor = {Marco Dorigo and Mauro Birattari and Christian Blum and Luca Maria Gambardella and Francesco Mondada and Thomas Stützle},
  volume = {3172},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-22672-9},
}