Hao Breakout local search for the max-cut problem Eng Appl Artif Intell, 26 (3) (2013), pp. 1162-1173 View PDFView articleView in ScopusGoogle Scholar [3] Benlic U, Hao JK. Breakout local search for the vertex separator problem. Int J Conf Artif Intell (IJCAI) 2013, 461-467. ...
Given an undirected graph G = (V,E), the minimum sum coloring problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of G such that the total sum of the colors assigned to the vertices is minimized. I