A metaheuristie approach for the vertex coloring problem

INFORMS Journal on Computing

Volumn 20, Issue 2, 2008, Pages 302-316

  Malaguti, Enrico ^a   Monaci, Michele ^b   Toth, Paolo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

Evolutionary algorithm; Heuristics; Set covering

Indexed keywords

EID: 61349113300     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1070.0245     Document Type: Article

References (28)

1. Blöchliger, L, N. Zufferey, 2008. A graph coloring heuristic using partial solutions and a reactive tabu scheme. Comput. Oyer. Res. 35 960-975.
2. Bollobàs, B., A. Thomason. 1985. Random graphs of small order. Ann. Discrete Math. 28 47-97.
3. Brèlaz, D. 1979. New methods to color the vertices of a graph. Comm. ACM 22 251-256.
4. Caprara, A., M. Fischetti, P Toth. 1999. A heuristic method for the set covering problem. Oper. Res. 47 730-743.
5. Caramia, M., P. Dell'Olmo. 1999. A fast and simple local search for graph coloring. J. S. Vitter, C. D. Zaroliagis, eds. Proc. 3rd Workshop on Algorithm Engrg. WAE'99, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 319-313.
6. Chow, F. C, J. L. Hennessy. 1990. The priority-based coloring approach to register allocation. ACM Trans. Programming Languages Systems 12 501-536.
7. Culberson, J. C, F. Luo. 1996. Exploring the k-colorable landscape with iterated greedy. D. S. Johnson, M. A. Trick, eds. Cliques, Coloring, and Satisfiability: 2nd DIMACS Implementation Challenge, 1993. DIMACS Scries in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, RI, 245-284.
8. Davis, L. 1998. Handbook of Genetic Algorithms. Van Nostrand Rein- hold, New York.
9. de Werra, D. 1985. An introduction to timetabling. Eur. J. Oper. Res. 19 151-162.
10. Diaz, I. M., P. Zabala. 2002. A branch and cut algorithm for graph coloring. D. S. Johnson, A. Mchrotra, M. Trick, eds. Proc. Computational Sympos. Graph Coloring and Its Generalization, Ithaca, NY, 55-62.
11. Dongarra, J. J. 2006. Performance of various computers using standard linear equations software (linpack benchmark report). Technical Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville.
12. Dome, R., J. K. Hao. 1998. Tabu search for graph coloring, t-coloring and set t-colorings, S. Voss, S. Martello, I. H. Osman, C. Roucairol, eds. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Boston, 77-92.
13. Fleurent, C, J. A. Ferland. 1996. Object-oriented implementation of heuristic search methods for graph coloring. D. S. Johnson, M. A. Trick, eds. Cliques, Coloring, and Satisfiability: 2nd DIMACS Implementation Challenge, 1993. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, RI 619-652.
14. Funabiki, N., T. Higashino. 2000. A minimal-state processing search algorithm for graph coloring problems. IEICE Trans. Fundamentals E83-A 1420-1430.
15. Galinier, P., J. K. Hao. 1999. Hybrid evolutionary algorithms for graph coloring. J. Combin. Optim. 3 379-397.
16. Gamst, A. 1986. Some lower bounds for a class of frequency assignment problems. IEEE Trans. Vehicular Tech. 35 8-14.
17. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco.
18. Glover, F., M. Laguna. 1997. Tabu Search. Kluwer Academic Publishers, Norwell, MA.
19. Hertz, A., D. de Werra. 1987. Using tabu search techniques for graph coloring. Computing 39 345-351.
20. Johnson, D. S., M. A. Trick. 1996. Cliques, Coloring, and Satisfiability: 2nd DIMACS Implementation Challange, 1993. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, RI.
21. Johnson, D. S., C. R. Aragon, L. A. McGeoch, C. Schevon. 1991. Optimization by simulated annealing: An experimental evaluation; Part II, graph coloring and number partitioning. Oper. Res. 39 378-406.
22. Leighton, F. T. 1979. A graph coloring algorithm for large scheduling problems. J. Res. National Bureau Standards 84 489-503.
23. Mehrotra, A., M. A. Trick. 1996. A column generation approach for graph coloring. INFORMS J. Comput. 8 344-354.
24. Monaci, M., P. Toth. 2006. A set-covering based heuristic approach for bin-packing problems. INFORMS J. Comput. 18 71-85.
25. Morgenstern, C. A. 1996. Distributed coloration neighborhood search. D. S. Johnson, M. A. Trick, eds. Cliques, Coloring, and Satisfiability: 2nd DIMACS Implementation Challange, 1993. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, RI, 335-358.
26. Sager, T. J., S. Lin. 1991. A pruning procedure for exact graph coloring. ORSA J. Comput. 3 226-230.
27. Sewell, E. C. 1996. An improved algorithm for exact graph coloring. D. S. Johnson, M. A. Trick, eds. Cliques, Coloring, and Satisfiability: 2nd DIMACS Implementation Challange, 1993. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, RI, 359-373.
28. Woo, T. K., S. Y. W. Su, R. Newman Wolfe. 2002. Resource allocation in a dynamically partitionable bus network using a graph coloring algorithm. IEEE Trans. Comm. 39 1794-1801.