1. Alidaee, B., Glover, F., Kochenberger, G., Wang, H.: Solving the maximum edge weight clique problem via unconstrained quadratic programming. Eur. J. Oper. Res. 181(2), 592–597 (2007)
2. Aringhieri, R., Bruglieri, M., Cordone, R.: Optimal results and tight bounds for the maximum diversity problem. Found. Comput. Decis. Sci. 34(2), 73 (2009)
3. Bahadur, K., Akutsu, T., Tomita, E., Seki, T.: Protein side-chain packing problem: a maximum edge-weight clique algorithmic approach. In: The Second Conference on Asia-Pacific Bioinformatics, vol. 29, pp. 191–200. Australian Computer Society, Inc. (2004)
4. Batsyn, M., Goldengorin, B., Maslov, E., Pardalos, P.M.: Improvements to MCS algorithm for the maximum clique problem. J. Comb. Optim. 27(2), 397–416 (2014)
5. Bogdanova, G.T., Brouwer, A.E., Kapralov, S.N., Östergård, P.R.: Error-correcting codes over an alphabet of four elements. Des. Codes Cryptogr. 23(3), 333–342 (2001)