hybridmeta.bib

@comment{{This file has been generated by bib2bib 1.97}}

@comment{{Command line: /usr/bin/bib2bib --expand -ob hybridmeta.bib -oc hybridmeta-list.bib ../all-entries.bib ./bib-gualandi.bib -c 'keywords : "graph coloring problem"' -c 'keywords : "hybrid metaheuristics"'}}

@incollection{FleFer96,
  title = {Object-oriented implementation of heuristics search methods for Graph Coloring, Maximum Clique, and Satisfiability},
  author = {Charles Fleurent and Jacques Ferland},
  pages = {619--652},
  crossref = {dimacs96},
  keywords = {graph coloring problem, local search methods, hybrid metaheuristics}
}

@incollection{Lew96,
  title = {Experiments with parallel graph coloring heuristics and applications of graph coloring},
  author = {G. Lewandowski and A. Condon},
  pages = {309--334},
  crossref = {dimacs96},
  keywords = {graph coloring problem, local search methods, hybrid metaheuristics, applications, instances},
  opturl = {citeseer.nj.nec.com/75655.html}
}

@inproceedings{BloZuf05,
  title = {A Reactive Tabu Search Using Partial Solutions for the Graph Coloring Problem},
  author = {Ivo Bl\"ochliger and Nicolas Zufferey},
  booktitle = {Coloring graphs from lists with bounded size of their union: result from Dagstuhl Seminar 03391},
  year = {2003},
  address = {Department of Applied Mathematics and Institute for Theoretical Computer Science, Prague},
  editor = {Daniel Kral and Jiri Sgall},
  series = {ITI-Series},
  volume = {156},
  keywords = {graph coloring problem, local search methods, hybrid metaheuristics}
}

@techreport{AIDA-03-01,
  title = {Local Search for the Graph Colouring Problem. {A} Computational Study},
  author = {M. Chiarandini and I. Dumitrescu and T. St{\"u}tzle},
  institution = {Intellectics Group, Computer Science Department, Darmstadt University of Technology},
  year = {2003},
  address = {Darmstadt, Germany},
  month = {January},
  number = {AIDA--03--01},
  file = {AIDA-03-01.pdf:Files/AIDA-03-01.pdf:PDF},
  keywords = {Chiarandini, graph coloring problem, local search methods, hybrid metaheuristics},
  pages = {1--16},
  url = {Files/AIDA-03-01.pdf}
}

@inproceedings{ChiStu02:cs,
  title = {An application of Iterated Local Search to Graph Coloring},
  author = {M. Chiarandini and T. St\"utzle},
  booktitle = {Proceedings of the Computational Symposium on Graph Coloring and its Generalizations},
  year = {2002},
  address = {Ithaca, New York, USA},
  editor = {D. S. Johnson and A. Mehrotra and M. Trick},
  month = {September},
  pages = {112--125},
  keywords = {Chiarandini, graph coloring problem, local search methods, hybrid metaheuristics},
  url = {Files/gcp-ils-Ithaca.pdf}
}

@techreport{Cul92,
  title = {Iterated Greedy Graph Coloring and the Difficulty Landscape},
  author = {J.C. Culberson},
  institution = {Department of Computing Science, The University of Alberta, Edmonton, Alberta, Canada},
  year = {1992},
  month = jun,
  number = {92-07},
  keywords = {graph coloring problem, local search methods, hybrid metaheuristics, empirical analyses}
}

@article{DiSc03,
  title = {\textsc{EasyLocal++}: An object-oriented framework for flexible design of local search algorithms},
  author = {Luca {Di Gaspero} and Andrea Schaerf},
  journal = {Software --- Practice \& Experience},
  year = {2003},
  month = {July},
  number = {8},
  pages = {733--765},
  volume = {33},
  keywords = {graph coloring problem, local search methods, hybrid metaheuristics},
  opturl = {http://www.diegm.uniud.it/satt/papers/DiSc03.pdf}
}

@article{FunHig00,
  title = {A minimal-state processing search algorithm for graph coloring problems},
  author = {Nobuo Funabiki and Teruo Higashino},
  journal = {IEICE Transactions on Fundamentals},
  year = {2000},
  number = {7},
  pages = {1420--1430},
  volume = {E83-A},
  keywords = {graph coloring problem, local search methods, hybrid metaheuristics}
}

@article{DBLP:journals/dam/GalinierHZ08,
  title = {An adaptive memory algorithm for the $k$-coloring problem},
  author = {Philippe Galinier and Alain Hertz and Nicolas Zufferey},
  journal = {Discrete Applied Mathematics},
  year = {2008},
  number = {2},
  pages = {267-279},
  volume = {156},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  doi = {10.1016/j.dam.2006.07.017},
  keywords = {graph coloring problem, local search methods, hybrid metaheuristics}
}

@article{Jag96,
  title = {An adaptive, multiple restarts neural network algorithm for graph coloring},
  author = {Arun Jagota},
  journal = {European Journal of Operational Research},
  year = {1996},
  number = {2},
  pages = {257--270},
  volume = {93},
  keywords = {graph coloring problem, local search methods, hybrid metaheuristics}
}

@inproceedings{KirPot98,
  title = {Efficient coloring of a large spectrum of graphs},
  author = {Darko Kirovski and Miodrag Potkonjak},
  booktitle = {DAC '98: Proceedings of the 35th annual conference on Design automation},
  year = {1998},
  address = {New York, NY, USA},
  pages = {427--432},
  publisher = {ACM Press},
  doi = {http://doi.acm.org/10.1145/277044.277165},
  isbn = {0-89791-964-5},
  keywords = {graph coloring problem, local search methods, hybrid metaheuristics},
  location = {San Francisco, California, United States}
}

@incollection{PaqStu02,
  title = {An Experimental Investigation of Iterated Local Search for Coloring Graphs},
  author = {L. Paquete and T. St\"utzle},
  booktitle = {Applications of Evolutionary Computing},
  publisher = {Springer Verlag, Berlin, Germany},
  year = {2002},
  editor = {S. Cagnoni and J. Gottlieb and E. Hart and M. Middendorf and G.R. Raidl},
  pages = {122--131},
  series = {Lecture Notes in Computer Science},
  volume = {2279},
  keywords = {graph coloring problem, local search methods, hybrid metaheuristics},
  optaddress = {Berlin, Germany}
}

@techreport{Wal01,
  title = {A Multilevel Approach to the Graph Colouring Problem},
  author = {C. Walshaw},
  institution = {School of Computing and Mathematical Science, Univeristy of Greenwich, London, UK},
  year = {2001},
  month = {May},
  number = {01/IM/69},
  isbn = {1-899991-70-0},
  keywords = {graph coloring problem, local search methods, hybrid metaheuristics},
  optdoc_url = {http://staffweb.cms.gre.ac.uk/~c.walshaw/papers/fulltext/WalshawTR6901.pdf}
}

@article{Wu2012,
  title = {Coloring large graphs based on independent set extraction},
  author = {Qinghua Wu and Jin-Kao Hao},
  journal = {Computers \& Operations Research},
  year = {2012},
  number = {2},
  pages = {283 - 290},
  volume = {39},
  abstract = {This paper presents an effective approach (EXTRACOL) to coloring large graphs. The proposed approach uses a preprocessing method to extract large independent sets from the graph and a memetic algorithm to color the residual graph. Each preprocessing application identifies, with a dedicated tabu search algorithm, a number of pairwise disjoint independent sets of a given size in order to maximize the vertices removed from the graph. We evaluate EXTRACOL on the 11 largest graphs (with 1000 to 4000 vertices) of the DIMACS challenge benchmarks and show improved results for four very difficult graphs (DSJC1000.9, C2000.5, C2000.9, C4000.5). The behavior of the proposed algorithm is also analyzed.},
  doi = {10.1016/j.cor.2011.04.002},
  issn = {0305-0548},
  keywords = {graph coloring problem, hybrid metaheuristics},
  opturl = {http://www.sciencedirect.com/science/article/pii/S0305054811000979}
}

@book{dimacs96,
  title = {Cliques, Coloring, and Satisfiability: Second {DIMACS} Implementation Challenge, 1993},
  editor = {David S. Johnson and Michael Trick},
  publisher = {American Mathematical Society, Providence, RI, USA},
  year = {1996},
  series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
  volume = {26},
  keywords = {graph coloring problem, surveys}
}