A Q'tron Neural-Network Approach to Solve the Graph Coloring Problems
暂无分享,去创建一个
Tai-Wen Yue | Zou Zhong Lee | T. Yue | Z. Lee
[1] Chirag M. Patel,et al. An ant-based algorithm for coloring graphs , 2008, Discret. Appl. Math..
[2] Alain Hertz,et al. Using tabu search techniques for graph coloring , 1987, Computing.
[3] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..
[4] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[5] Henri Luchian,et al. A New Genetic Graph Coloring Heuristic , 2002 .
[6] Howard A. Peelle. Graph coloring in J: an introduction , 2000, ACM SIGAPL APL Quote Quad.
[7] Li-Chen Fu,et al. A complete neural network approach to solving a class of combinatorial problems , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.