Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem

Simone Faro, Elisa Pappalardo. Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem. In Jan van Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorný, Bernhard Rumpe, editors, SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings. Volume 5901 of Lecture Notes in Computer Science, pages 370-381, Springer, 2010. [doi]

@inproceedings{FaroP10,
  title = {Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem},
  author = {Simone Faro and Elisa Pappalardo},
  year = {2010},
  doi = {10.1007/978-3-642-11266-9_31},
  url = {http://dx.doi.org/10.1007/978-3-642-11266-9_31},
  tags = {optimization},
  researchr = {https://researchr.org/publication/FaroP10},
  cites = {0},
  citedby = {0},
  pages = {370-381},
  booktitle = {SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings},
  editor = {Jan van Leeuwen and Anca Muscholl and David Peleg and Jaroslav Pokorný and Bernhard Rumpe},
  volume = {5901},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-11265-2},
}