New results on the queens_n2 graph coloring problem

Journal of Heuristics

Volumn 10, Issue 4, 2004, Pages 407-413

  Vasquez, Michel ^a  

^a ECOLE DES MINES D ALÈS   (France)

Author keywords

Cliques based filtering; Graph coloring; Independent sets; Queens graphs

Indexed keywords

ADDERS; ALGORITHMS; COLORING; COMPUTATIONAL METHODS; DECISION MAKING; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

CLIQUES BASED FILTERING; GRAPH COLORING; INDEPENTEND SETS; QUEENS GRAPHS;

GRAPH THEORY;

EID: 3142739751     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:HEUR.0000034713.28244.e1     Document Type: Article

References (8)

1. Caramia, M. and P. Dell'Olmo. (2001). " Iterative Coloring Extension of a Maximum Clique." Naval Research Logistic 48(6), 518-550.
2. Caramia, M. and P. Dell'Olmo. (2002). " Constraint Propagation in Graph Coloring." Journal of Heuristic 8, 83-107.
3. Chiarandini, M. and T. Stützle. (2002). " An Application of Iterated Local Searchto Graph Coloring Problem." In Mehrotra, A., Johnson, D.S., and Trick, M. (eds.), Proceedings of the Computational Symposium on Graph Coloringand its Generalizations. Ithaca, New York, USA, pp. 112-125.
4. Gardner, M. (1995). Further Mathematical Diversions: The Paradox of the Unexpected Hanging and Others. Mathematical Association of America.
5. Hamiez, J.P. (2002). " Coloration de Graphes et Planification de Rencontressportives: Heuristiques, Algorithmes et Analyses." PhD thesis, Universitéd' Angers.
6. Kochenberger, G., F. Glover, B. Alidaee, and C. Rego. (to appear). " An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem." Annals of Operations Research.
7. Mehrotra, A. and M.A. Trick. (1996). A Column Generation Approach for Graph Coloring." INFORMS Journal of Computing 8(4), 344-354.
8. Sabin, D. and E. Freuder. (1994). " Contradicting Conventional Wisdom in Con-Straint Satisfaction." In ECAI'94, Amsterdam, pp. 125-129.