42 citations · 78 across the 3 of their papers we have counts for
3 papers
cs.DM2015★ 33 cited
Algorithms for the minimum sum coloring problem: a review
Yan Jin, Jean-Philippe Hamiez, Jin-Kao Hao
The Minimum Sum Coloring Problem (MSCP) is a variant of the well-known vertex coloring problem which has a number of AI related applications. Due to its theoretical and practical r…
cs.DS2014★ 3 cited
A note on a sports league scheduling problem
Jean-Philippe Hamiez, Jin-Kao Hao
Sports league scheduling is a difficult task in the general case. In this short note, we report two improvements to an existing enumerative search algorithm for a NP-hard sports le…
cs.DM2013★ 42 cited
A memetic algorithm for the minimum sum coloring problem
Yan Jin, Jin-Kao Hao, Jean-Philippe Hamiez
Given an undirected graph , the Minimum Sum Coloring problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of such that the…