A New Genetic Local Search Algorithm for Graph Coloring
暂无分享,去创建一个
[1] Bernd Freisleben,et al. New Genetic Local Search Operators for the Traveling Salesman Problem , 1996, PPSN.
[2] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..
[3] Bernd Freisleben,et al. A Genetic Local Search Approach to the Quadratic Assignment Problem , 1997, ICGA.
[4] D. Werra,et al. Some experiments with simulated annealing for coloring graphs , 1987 .
[5] Alain Hertz,et al. Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs , 1995, J. Heuristics.
[6] Craig A. Morgenstern. Distributed coloration neighborhood search , 1993, Cliques, Coloring, and Satisfiability.
[7] Daniel Brélaz,et al. New methods to color the vertices of a graph , 1979, CACM.
[8] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[9] Manuel Laguna,et al. Tabu Search , 1997 .
[10] Jin-Kao Hao,et al. Tabu Search for Graph Coloring, T-Colorings and Set T-Colorings , 1999 .
[11] Charles Fleurent,et al. Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..
[12] Emanuel Falkenauer,et al. A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.
[13] Jin-Kao Hao,et al. Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..
[14] Frank Thomson Leighton,et al. A Graph Coloring Algorithm for Large Scheduling Problems. , 1979, Journal of research of the National Bureau of Standards.