论文信息 - EPCOT : an Efficient Procedure for Coloring Optimally with Tabu search - 字舞流文

EPCOT : an Efficient Procedure for Coloring Optimally with Tabu search

D. Werra | N. Dubois

[1] Alain Hertz,et al. Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph , 1990, Comput. Oper. Res..

[2] Alain Hertz,et al. Tabu search techniques , 1989 .

[3] Marek Kubale,et al. A generalized implicit enumeration algorithm for graph coloring , 1985, CACM.

[4] Daniel Brélaz,et al. New methods to color the vertices of a graph , 1979, CACM.

[5] J. R. Brown. Chromatic Scheduling and the Chromatic Number Problem , 1972 .

[6] D. de Werra,et al. Heuristics for graph coloring , 1989 .

[7] J. Spencer. Ten lectures on the probabilistic method , 1987 .