Tabu search algorithms for the maximum clique problem

Patrick Soriano, Michel Gendreau. Tabu search algorithms for the maximum clique problem. In David S. Johnson, Michael A. Trick, editors, Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993. Volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 221-244, DIMACS/AMS, 1993.

@inproceedings{SorianoG93,
  title = {Tabu search algorithms for the maximum clique problem},
  author = {Patrick Soriano and Michel Gendreau},
  year = {1993},
  researchr = {https://researchr.org/publication/SorianoG93},
  cites = {0},
  citedby = {0},
  pages = {221-244},
  booktitle = {Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993},
  editor = {David S. Johnson and Michael A. Trick},
  volume = {26},
  series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
  publisher = {DIMACS/AMS},
}