A GRASP/VND Heuristic for the Max Cut-Clique Problem

Mathias Bourel, Eduardo A. Canale, Franco Robledo, Pablo Romero, Luis Stábile. A GRASP/VND Heuristic for the Max Cut-Clique Problem. In Giuseppe Nicosia, Panos M. Pardalos, Giovanni Giuffrida, Renato Umeton, Vincenzo Sciacca, editors, Machine Learning, Optimization, and Data Science - 4th International Conference, LOD 2018, Volterra, Italy, September 13-16, 2018, Revised Selected Papers. Volume 11331 of Lecture Notes in Computer Science, pages 357-367, Springer, 2018. [doi]

@inproceedings{BourelCRRS18,
  title = {A GRASP/VND Heuristic for the Max Cut-Clique Problem},
  author = {Mathias Bourel and Eduardo A. Canale and Franco Robledo and Pablo Romero and Luis Stábile},
  year = {2018},
  doi = {10.1007/978-3-030-13709-0_30},
  url = {https://doi.org/10.1007/978-3-030-13709-0_30},
  researchr = {https://researchr.org/publication/BourelCRRS18},
  cites = {0},
  citedby = {0},
  pages = {357-367},
  booktitle = {Machine Learning, Optimization, and Data Science - 4th International Conference, LOD 2018, Volterra, Italy, September 13-16, 2018, Revised Selected Papers},
  editor = {Giuseppe Nicosia and Panos M. Pardalos and Giovanni Giuffrida and Renato Umeton and Vincenzo Sciacca},
  volume = {11331},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-13709-0},
}