Publisher
Springer Nature Switzerland
Reference7 articles.
1. Benlic, U., Hao, J.K.: Breakout local search for the quadratic assignment problem. Appl. Math. Comput. 219(9), 4800–4815 (2013)
2. Benlic, U., Hao, J.K.: Breakout local search for the vertex separator problem. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, pp. 461–467. AAAI Press (2013)
3. Brimberg, J., Mladenović, N., Urošević, D., Ngai, E.: Variable neighborhood search for the heaviest k-subgraph. Comput. Oper. Res. 36(11), 2885–2891 (2009)
4. Corneil, D.G., Perl, Y.: Clustering and domination in perfect graphs. Discret. Appl. Math. 9(1), 27–39 (1984)
5. Letsios, M., Balalau, O.D., Danisch, M., Orsini, E., Sozio, M.: Finding heaviest k-subgraphs and events in social media. In: 2016 IEEE 16th International Conference on Data Mining Workshops, pp. 113–120. IEEE (2016)