Metaheuristics for robust graph coloring
暂无分享,去创建一个
[1] Jin-Kao Hao,et al. A New Genetic Local Search Algorithm for Graph Coloring , 1998, PPSN.
[2] Paolo Toth,et al. A survey on vertex coloring problems , 2010, Int. Trans. Oper. Res..
[3] Nicolas Zufferey,et al. A graph coloring heuristic using partial solutions and a reactive tabu scheme , 2008, Comput. Oper. Res..
[4] Alain Hertz,et al. A survey of local search methods for graph coloring , 2004, Comput. Oper. Res..
[5] Fred W. Glover,et al. Diversification-driven tabu search for unconstrained binary quadratic problems , 2010, 4OR.
[6] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..
[7] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[8] Fred W. Glover,et al. An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem , 2005, Ann. Oper. Res..
[9] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..
[10] Alain Hertz,et al. Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs , 1995, J. Heuristics.
[11] Alain Hertz,et al. Using tabu search techniques for graph coloring , 1987, Computing.
[12] Bernd Freisleben,et al. Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming , 2002, J. Heuristics.
[13] Jin-Kao Hao,et al. Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..
[14] D. R. Lick,et al. The Theory and Applications of Graphs. , 1983 .
[15] A. Gamst,et al. Some lower bounds for a class of frequency assignment problems , 1986, IEEE Transactions on Vehicular Technology.
[16] D. Werra,et al. Some experiments with simulated annealing for coloring graphs , 1987 .
[17] Craig A. Morgenstern. Distributed coloration neighborhood search , 1993, Cliques, Coloring, and Satisfiability.
[18] M. Trick,et al. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993 , 1996 .
[19] Gregory J. Chaitin,et al. Register allocation and spilling via graph coloring , 2004, SIGP.
[20] Lawrence. Davis,et al. Handbook Of Genetic Algorithms , 1990 .
[21] Charles Fleurent,et al. Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..
[22] Andrew Lim,et al. A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem , 2003, Australian Conference on Artificial Intelligence.
[23] P. Pardalos,et al. Handbook of Combinatorial Optimization , 1998 .
[24] Carlo Mannino,et al. Models and solution techniques for frequency assignment problems , 2003, 4OR.
[25] Nicolas Zufferey,et al. Graph colouring approaches for a satellite range scheduling problem , 2008, J. Sched..
[26] Rafael Martí,et al. A GRASP for Coloring Sparse Graphs , 2001, Comput. Optim. Appl..
[27] Alain Hertz,et al. A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization , 1999, J. Heuristics.
[28] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[29] Javier Yáñez,et al. The robust coloring problem , 2003, Eur. J. Oper. Res..
[30] Alain Hertz,et al. A variable neighborhood search for graph coloring , 2003, Eur. J. Oper. Res..
[31] David S. Johnson,et al. Cliques, Coloring, and Satisfiability , 1996 .
[32] Alain Hertz,et al. An adaptive memory algorithm for the k-coloring problem , 2003, Discret. Appl. Math..
[33] J.R. Rodriguez,et al. Algorithms for robust graph coloring on paths , 2005, 2005 2nd International Conference on Electrical and Electronics Engineering.
[34] P. Pardalos,et al. The Graph Coloring Problem: A Bibliographic Survey , 1998 .
[35] Magnús M. Hallórsson. A still better performance guarantee for approximate graph coloring , 1993 .