Binary Merge Model Representation of the Graph Colouring Problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3004, Issue , 2004, Pages 124-134

  Juhos, István ^a   Tóth, Attila ^a   Van Hemert, Jano I ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

EMPIRICAL - COMPARISONS; GRAPH COLOURING; HEIDELBERG; HEURISTIC MUTATION; MODEL REPRESENTATION; PROBLEM INSTANCES;

EVOLUTIONARY ALGORITHMS;

EID: 35048904147     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24652-7_13     Document Type: Article

References (19)

1. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press (1993)
2. Johnson, D., Trick, M.: Cliques, Coloring, and Satisfiability. American Mathematical Society, DIMACS (1996)
3. Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing 39 (1987) 345-351
4. Chams, M., Hertz, A., Werra, D.D.: Some experiments with simulated annealing for coloring graphs. European Journal of Operational Research 32 (1987) 260-266
5. Vesel, A., Zerovnik, J.: How good can ants color graphs? Journal of computing and Information Technology - GIT 8 (2000) 131-136
6. Eiben, A., van der Hauw, J., van Hemert, J.: Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics 4 (1998) 25-46
7. van Hemert, J.: Comparing classical methods for solving binary constraint satisfaction problems with state of the art evolutionary computation. In et al., S.C., ed.: Applications of Evolutionary Computing. Volume 2279 of LNCS. (2002) 81-90
8. van Hemcrt, J., Back, T.: Measuring the searched space to guide efficiency: The principle and evidence on constraint satisfaction. In et ai, J.M., ed.: Proceedings of Parallel Problem Solving from Nature VII. Number 2439 in LNCS (2002) 23-32
9. Marino, A., Damper, R.: Breaking the symmetry of the graph colouring problem with genetic algorithms. In Whitley, D., ed.: Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference. (2000) 240-245
10. Culberson, J.: Iterated greedy graph coloring and the difficulty landscape. Technical Report TR 92-07, University of Alberta, Dept. of Computing Science (1992)
11. Culberson, J., Gent, I.: Frozen development in graph coloring. Theoretical Computer Science 265 (2001) 227-264
12. Keijzer, M., Merelo, J., Romero, G., Schoenauer, M.: Evolving objects library. Internet Publication (2002)
13. Back, T., Fogel, D., Michalewicz, Z., eds.: Handbook of Evolutionary Computation. Institute of Physics Publishing Ltd, Bristol and Oxford University Press, New York (1997)
14. Falkenauer, E.: Genetic Algorithms and Grouping Problems. John Wiley (1998)
15. Trick, M.: Easy code for graph coloring. Internet Publication (1995) Last Modified: November 2, 1994.
16. Brélaz, D.: New methods to color the vertices of a graph. Communications of the ACM 22 (1979) 251-256
17. Mehrotra, A., Trick, M.A.: A column generation approach for graph coloring. INFORMS Journal on Computing 8 (1996) 344-354
18. Trick, M.: Computational scries: Graph coloring and its generalizations (2003) http://mat.gsia.emu.edu/COLORING03.
19. Juhos, L, Toth, A., Tezuka, M., Tann, P., van Hemert, J.: A new permutation model for solving the graph k-coloring problem. In: Kalmar Workshop on Logic and Computer Science. (2003) 189-199