Complexity and heuristics for the weighted max cut-clique problem

Mathias Bourel, Eduardo Alberto Canale, Franco Robledo, Pablo Romero, Luis Stábile. Complexity and heuristics for the weighted max cut-clique problem. ITOR, 29(2):908-928, 2022. [doi]

@article{BourelCRRS22,
  title = {Complexity and heuristics for the weighted max cut-clique problem},
  author = {Mathias Bourel and Eduardo Alberto Canale and Franco Robledo and Pablo Romero and Luis Stábile},
  year = {2022},
  doi = {10.1111/itor.12807},
  url = {https://doi.org/10.1111/itor.12807},
  researchr = {https://researchr.org/publication/BourelCRRS22},
  cites = {0},
  citedby = {0},
  journal = {ITOR},
  volume = {29},
  number = {2},
  pages = {908-928},
}