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

@comment{{Command line: /usr/bin/bib2bib --expand -ob popmeta.bib -oc popmeta-list.bib ../all-entries.bib ./bib-gualandi.bib -c 'keywords : "graph coloring problem"' -c 'keywords : "population-based metaheuristics" | keywords : "evolutionary algorithms"'}}

@inproceedings{BuiPat02, title = {An Ant System Algorithm for Coloring Graphs}, author = {Thang N. Bui and Chirag M. Patel}, pages = {83--91}, crossref = {symposium02}, keywords = {graph coloring problem, local search methods, population-based metaheuristics} }

@inproceedings{CroLucGheApe02, title = {A New Genetic Graph Coloring Heuristic}, author = {Cornelius Croitoru and Henri Luchian and Ovidiu Gheorghies and Adriana Apetrei}, pages = {63--74}, crossref = {symposium02}, keywords = {graph coloring problem, evolutionary algorithms} }

@inproceedings{GalHerZuf03, title = {Adaptive Memory Algorithms for Graph Colouring}, author = {P. Galinier and A. Hertz and N. Zufferey}, note = {Also available as Technical Report G--2003--35, Les Cachiers du GERAD}, pages = {75--82}, crossref = {symposium02}, keywords = {graph coloring problem, evolutionary algorithms} }

@incollection{Mor96, title = {Distributed Coloration Neighborhood Search}, author = {C. Morgenstern}, pages = {335--357}, crossref = {dimacs96}, keywords = {graph coloring problem, local search methods, population-based metaheuristics}, opturl = {citeseer.nj.nec.com/75655.html} }

@article{DBLP:journals/dam/BuiNPP08, title = {An ant-based algorithm for coloring graphs}, author = {Thang Nguyen Bui and ThanhVu H. Nguyen and Chirag M. Patel and Kim-Anh T. Phan}, journal = {Discrete Applied Mathematics}, year = {2008}, number = {2}, pages = {190-200}, volume = {156}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi = {10.1016/j.dam.2006.07.012}, keywords = {graph coloring problem, local search methods, population-based metaheuristics} }

@article{CosHerDub95, title = {Embedding of a Sequential Procedure within an Evolutionary Algorithm for Coloring Problems in Graphs}, author = {D. Costa and A. Hertz and O. Dubuis}, journal = {Journal of Heuristics}, year = {1995}, number = {1}, pages = {105--128}, volume = {1}, keywords = {graph coloring problem, evolutionary algorithms} }

@techreport{Croitoru2005, title = { An Ordering-Based Genetic Approach to Graph Coloring}, author = {Cornelius Croitoru and Ovidiu Gheorghie{\c s} and Adriana Gheorghie{\c s}}, institution = {``Al.I.Cuza'' University of Ia{\c s}i, Faculty of Computer Science}, year = {2005}, number = {TR 05-03}, keywords = {graph coloring problem, evolutionary algorithms} }

@article{CosHer97, title = {Ants Can Colour Graphs}, author = {Costa D. and A. Hertz}, journal = {Journal of the Operational Research Society}, year = {1997}, pages = {295--305}, volume = {48}, keywords = {graph coloring problem, local search methods, population-based metaheuristics} }

@incollection{Davis91, title = {Order-based Genetic Algorithms and the Graph Coloring Problem}, author = {L. Davis}, booktitle = {Handbook of Genetic Algorithms}, publisher = {Van Nostrand Reinhold; New York}, year = {1991}, pages = {72--90}, keywords = {graph coloring problem, evolutionary algorithms} }

@incollection{DorHao98, title = {A New Genetic Local Search Algorithm for Graph Coloring}, author = {R. Dorne and J. Hao}, booktitle = {Parallel Problem Solving from Nature - PPSN V, 5th International Conference}, publisher = {Springer Verlag, Berlin, Germany}, year = {1998}, editor = {A. E. Eiben and Thomas B\"ack and Marc Schoenauer and Hans-Paul Schwefel}, pages = {745--754}, series = {Lecture Notes in Computer Science}, volume = {1498}, keywords = {graph coloring problem, evolutionary algorithms}, optaddress = {Berlin, Germany}, opturl = {citeseer.nj.nec.com/dorne98new.html} }

@article{DowTho07, title = {An improved ant colony optimisation heuristic for graph colouring}, author = {Kathryn A. Dowsland and Jonathan M. Thompson}, journal = {Discrete Applied Mathematics}, year = {2007}, note = {In Press, Corrected Proof.}, doi = {doi:10.1016/j.dam.2007.03.025}, keywords = {graph coloring problem, local search methods, population-based metaheuristics} }

@article{Eiben98, title = {Graph Coloring with Adaptive Evolutionary Algorithms}, author = {A. E. Eiben and J. K. Van Der Hauw and J. I. Van Hemert}, journal = {Journal of Heuristics}, year = {1998}, number = {1}, pages = {25--46}, volume = {4}, address = {Hingham, MA, USA}, doi = {10.1023/A:1009638304510}, issn = {1381-1231}, keywords = {graph coloring problem, evolutionary algorithms}, publisher = {Kluwer Academic Publishers} }

@article{FleFer96:aor, title = {Genetic and Hybrid Algorithms for Graph Coloring}, author = {C. Fleurent and J. Ferland}, journal = {Annals of Operations Research}, year = {1996}, pages = {437--464}, volume = {63}, keywords = {graph coloring problem, evolutionary algorithms} }

@inproceedings{FotLikSte01, title = {An Evolutionary Annealing Approach to Graph Coloring}, author = {Dimitris Fotakis and Spiridon D. Likothanassis and Stamatis Stefanakos}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops 2001}, year = {2001}, editor = {Egbert J. W. Boers and Jens Gottlieb and Pier Luca Lanzi and Robert E. Smith and Stefano Cagnoni and Emma Hart and G{\"u}nther R. Raidl and H. Tijink}, pages = {120-129}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {2037}, keywords = {graph coloring problem, evolutionary algorithms} }

@article{GalHao99, title = {Hybrid evolutionary algorithms for graph coloring}, author = {P. Galinier and J. Hao}, journal = {Journal of Combinatorial Optimization}, year = {1999}, number = {4}, pages = {379--397}, volume = {3}, doi = {10.1023/A:1009823419804}, keywords = {graph coloring problem, evolutionary algorithms}, opturl = {citeseer.nj.nec.com/galinier99hybrid.html} }

@article{GlaPru03, title = {Genetic Algorithms for Graph Colouring: Exploration of {G}alinier and {H}ao's Algorithm}, author = {C. A. Glass and Adam Pr{\"u}gel-Bennett}, journal = {Journal of Combinatorial Optimization}, year = {2003}, number = {3}, pages = {229--236}, volume = {7}, keywords = {graph coloring problem, evolutionary algorithms} }

@article{Lu2010, title = {A memetic algorithm for graph coloring}, author = {Zhipeng L{\"u} and Jin-Kao Hao}, journal = {European Journal of Operational Research}, year = {2010}, number = {1}, pages = {241 - 250}, volume = {203}, doi = {10.1016/j.ejor.2009.07.016}, issn = {0377-2217}, keywords = {graph coloring problem, evolutionary algorithms}, opturl = {http://www.sciencedirect.com/science/article/B6VCT-4WW9KRG-1/2/19472ecd6bdf18c9332a496485405254} }

@article{LorFur01, title = {Constructive Genetic Algorithm for Clustering Problems.}, author = {Luiz Antonio Nogueira Lorena and Jo{\~a}o Carlos Furtado}, journal = {Evolutionary Computation}, year = {2001}, number = {3}, pages = {309--328}, volume = {9}, bibsource = {DBLP, http://dblp.uni-trier.de}, keywords = {graph coloring problem, evolutionary algorithms} }

@article{Malaguti20080301, title = {A Metaheuristic Approach for the Vertex Coloring Problem}, author = {Malaguti, Enrico and Monaci, Michele and Toth, Paolo}, journal = {INFORMS Journal on Computing}, year = {2008}, number = {2}, pages = {p302 - 316}, volume = {20}, abstract = {Given an undirected graph G = (V,E), the vertex coloring problem (VCP) requires to assign a color to each vertex in such a way that colors on adjacent vertices are different and the number of colors used is minimized. In this paper, we propose a metaheuristic approach for VCP that performs two phases: the first phase is based on an evolutionary algorithm, whereas the second one is a postoptimization phase based on the set covering formulation of the problem. Computational results on a set of DIMACS instances show that the overall algorithm is able to produce high-quality solutions in a reasonable amount of time. For four instances, the proposed algorithm is able to improve the best-known solution while for almost all the remaining instances, it finds the best-known solution in the literature. ABSTRACT FROM AUTHOR Copyright of INFORMS Journal on Computing is the property of INFORMS: Institute for Operations Research and its content may not be copied or emailed to multiple sites or post}, doi = {10.1287/ijoc.1070.0245}, issn = {10919856}, keywords = {ALGORITHMS, MATHEMATICAL optimization, MATHEMATICAL analysis, NEURAL networks (Computer science), EVOLUTIONARY computation, ALGEBRA, evolutionary algorithm, heuristics, set covering, graph coloring problem, local search methods, evolutionary algorithms}, optfile = {:home/marco/Literature/MalagutiMonaciToth2008.pdf:PDF}, url = {http://search.ebscohost.com.proxy1-bib.sdu.dk:2048/login.aspx?direct=true&db=buh&AN=32007697&loginpage=Login.asp&site=ehost-live} }

@inproceedings{marino00breaking, title = {Breaking the Symmetry of the Graph Colouring Problem with Genetic Algorithms}, author = {Anna Marino and Robert I. Damper}, booktitle = {Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference}, year = {2000}, address = {Las Vegas, Nevada, USA}, editor = {Darrell Whitley}, pages = {240--245}, keywords = {graph coloring problem, evolutionary algorithms}, optmonth = {8}, opturl = {citeseer.ist.psu.edu/374201.html} }

@article{Plumettaz2010, title = {Ant Local Search and its efficient adaptation to graph colouring}, author = {Plumettaz, M. and Schindl, D. and Zufferey, N.}, journal = {Journal of Operational Research Society}, year = {2010}, number = {5}, pages = {819 -- 826}, volume = {61}, doi = {10.1057/jors.2009.27}, keywords = {graph coloring problem, population-based metaheuristics}, owner = {marco}, timestamp = {2010.08.06} }

@inproceedings{Por09, title = {Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms}, author = {Daniel Porumbel and Jin-Kao Hao and Pascale Kuntz}, booktitle = {9th European Conference on Evolutionary Computation in Combinatorial Optimisation (Evocop 2009)}, year = {2009}, address = {T{\"u}bingen, Germany}, keywords = {graph coloring problem, evolutionary algorithms}, url = {http://www.info.univ-angers.fr/pub/porumbel/papers/EVOCOP09.pdf} }

@article{Porumbel2010, title = {An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring}, author = {Daniel Cosmin Porumbel and Jin-Kao Hao and Pascale Kuntz}, journal = {Computers \& Operations Research}, year = {2010}, pages = {1822 - 1832}, volume = {37}, doi = {10.1016/j.cor.2010.01.015}, issn = {0305-0548}, issue = {10}, keywords = {graph coloring problem, evolutionary algorithms, Diversity control, Population management, Multi-parent crossover, Memetic and hybrid algorithm}, opturl = {http://www.sciencedirect.com/science/article/B6VC5-4Y9CFFX-4/2/aa95a380a3f6075d7f193d575f246148} }

@article{Talbi2007, title = {Breaking the search space symmetry in partitioning problems: An application to the graph coloring problem}, author = {El-Ghazali Talbi and Benjamin Weinberg}, journal = {Theoretical Computer Science}, year = {2007}, number = {1}, pages = {78 - 86}, volume = {378}, doi = {10.1016/j.tcs.2007.01.023}, issn = {0304-3975}, keywords = {graph coloring problem, population-based metaheuristics, theoretical analyses}, opturl = {http://www.sciencedirect.com/science/article/B6V1G-4N2TS51-1/2/c0e14c7ab5 b51f7eb823df7840578e48} }

@incollection{Titiloye2011a, title = {Graph Coloring with a Distributed Hybrid Quantum Annealing Algorithm}, author = {Titiloye, Olawale and Crispin, Alan}, booktitle = {Agent and Multi-Agent Systems: Technologies and Applications}, publisher = {Springer Berlin / Heidelberg}, year = {2011}, editor = {O'Shea, James and Nguyen, Ngoc and Crockett, Keeley and Howlett, Robert and Jain, Lakhmi}, pages = {553-562}, series = {Lecture Notes in Computer Science}, volume = {6682}, abstract = {Quantum simulated annealing is analogous to a population of agents cooperating to optimize a shared cost function defined as the total energy between them. A hybridization of quantum annealing with mainstream evolutionary techniques is introduced to obtain an effective solver for the graph coloring problem. The state of the art is advanced by the description of a highly scalable distributed version of the algorithm. Most practical simulated annealing algorithms require the reduction of a control parameter over time to achieve convergence. The algorithm presented is able to keep all its parameters fixed at their initial value throughout the annealing schedule, and still achieve convergence to a global optimum in reasonable time. Competitive results are obtained on challenging problems from the standard DIMACS benchmarks. Furthermore, for some of the graphs, the distributed hybrid quantum annealing algorithm finds better results than those of any known algorithm.}, affiliation = {School of Computing, Mathematics and Digital Technology, Manchester Metropolitan University, Manchester, M1 5GD U.K.}, doi = {10.1007/978-3-642-22000-5_57}, isbn = {978-3-642-21999-3}, keywords = {graph coloring problem, population-based metaheuristics}, optnote = {10.1007/978-3-642-22000-5_57} }

@article{Titiloye2011, title = {Quantum annealing of the graph coloring problem}, author = {Olawale Titiloye and Alan Crispin}, journal = {Discrete Optimization}, year = {2011}, number = {2}, pages = {376 - 384}, volume = {8}, abstract = {Quantum annealing extends simulated annealing by introducing artificial quantum fluctuations. The path-integral Monte Carlo version chosen is population-based and designed to be implemented on a classical computer. Its first application to the graph coloring problem is presented in this paper. It is shown by experiments that quantum annealing can outperform classical thermal simulated annealing for this particular problem. Moreover, quantum annealing proved competitive when compared with the best algorithms on most of the difficult instances from the DIMACS benchmarks. The quantum annealing algorithm has even found that the well-known benchmark graph dsjc1000.9 has a chromatic number of at most 222. This is an improvement on its best upper-bound from a large body of literature.}, doi = {DOI: 10.1016/j.disopt.2010.12.001}, issn = {1572-5286}, keywords = {graph coloring problem, population-based metaheuristics}, opturl = {http://www.sciencedirect.com/science/article/pii/S1572528610000721} }

@article{Xie2009a, title = {Graph coloring by multiagent fusion search}, author = {Xie, Xiao-Feng and Liu, Jiming}, journal = {Journal of Combinatorial Optimization}, year = {2009}, month = aug, number = {2}, pages = {99--123}, volume = {18}, abstract = {Abstract A multiagent fusion search is presented for the graph coloring problem. In this method, each of agents performs the fusion search, involving a local search working in a primary exploitation role and a recombination search in a navigation role, with extremely limited memory and interacts with others through a decentralized protocol, thus agents are able to explore in parallel as well as to achieve a collective performance. As the knowledge components implemented with available structural information and in formalized forms, the Quasi-Tabu local search and grouping-based recombination rules are especially useful in addressing neutrality and ruggedness of the problem landscape. The new method has been tested on some hard benchmark graphs, and has been shown competitive in comparison with several existing algorithms. In addition, the method provides new lower bound solutions when applied to two large graphs. Some search characteristics of the proposed method is also discussed.}, doi = {10.1007/s10878-008-9140-6}, keywords = {graph coloring problem, population-based metaheuristics}, owner = {marco}, timestamp = {2010.02.07} }

@proceedings{symposium02, title = {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}, booktitle = {Proceedings of the Computational Symposium on Graph Coloring and its Generalizations} }

@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} }