Cite
HARVARD Citation
Bourel, M. et al. (2022). Complexity and heuristics for the weighted max cut‐clique problem. International transactions in operational research. pp. 908-928. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Bourel, M. et al. (2022). Complexity and heuristics for the weighted max cut‐clique problem. International transactions in operational research. pp. 908-928. [Online].