simplemeta.bib
@comment{{This file has been generated by bib2bib 1.97}}
@comment{{Command line: /usr/bin/bib2bib --expand -ob simplemeta.bib -oc simplemeta-list.bib ../all-entries.bib ./bib-gualandi.bib -c 'keywords : "graph coloring problem"' -c 'keywords : "simple metaheuristics" | keywords: "local search"'}}
@inproceedings{Allen02,
title = {A Combined Algorithm for Graph-coloring in Register Allocation},
author = {M. Allen and G. Kumaran and T. Liu},
pages = {100--111},
crossref = {symposium02},
keywords = {graph coloring problem, local search methods, simple metaheuristics, applications}
}
@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{CutNicPav03,
title = {A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem},
author = {Vincenzo Cutello and Giuseppe Nicosia and Mario Pavone},
pages = {171--182},
crossref = {gecco2003:p},
keywords = {graph coloring problem, local search methods, simple 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}
}
@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}
}
@inproceedings{PhaSki02,
title = {Coloring Graphs With a General Heuristic Search Engine},
author = {Vinhthuy Phan and Steven Skiena},
pages = {92--99},
crossref = {symposium02},
keywords = {graph coloring problem, local search methods, simple metaheuristics}
}
@inproceedings{DBLP:conf/ae/PorumbelHK07,
title = {A Study of Evaluation Functions for the Graph K-Coloring Problem},
author = {Daniel Cosmin Porumbel and Jin-Kao Hao and Pascale Kuntz},
booktitle = {Artificial Evolution},
year = {2007},
pages = {124-135},
bibsource = {DBLP, http://dblp.uni-trier.de},
crossref = {DBLP:conf/ae/2007},
doi = {10.1007/978-3-540-79305-2_11},
keywords = {graph coloring problem, local search methods, simple metaheuristics}
}
@inproceedings{TriYil07,
title = {A Large Neighborhood Search Heuristic for Graph Coloring},
author = {Michael A. Trick and Hakan Yildiz},
year = {2007},
pages = {346-360},
bibsource = {DBLP, http://dblp.uni-trier.de},
crossref = {DBLP:conf/cpaior/2007},
doi = {10.1007/978-3-540-72397-4_25},
keywords = {graph coloring problem, local search methods, simple metaheuristics, large neighborhoods},
optbooktitle = {CPAIOR}
}
@article{AvaHerZuf03,
title = {A variable neighborhood search for graph coloring},
author = {C. Avanthay and A. Hertz and N. Zufferey},
journal = {European Journal of Operational Research},
year = {2003},
keywords = {graph coloring problem, local search methods, simple metaheuristics},
optpages = {379--388},
optvolume = {151}
}
@article{BloZuf08,
title = {A graph coloring heuristic using partial solutions and a reactive tabu scheme},
author = {Ivo Bl{\"o}chliger and Nicolas Zufferey},
journal = {Computers \& Operations Research},
year = {2008},
number = {3},
pages = {960--975},
volume = {35},
doi = {doi:10.1016/j.cor.2006.05.014},
keywords = {graph coloring problem, local search methods, simple metaheuristics}
}
@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}
}
@article{DiBJagHug03,
title = {A Range-Compaction Heuristic for Graph Coloring},
author = {Andrea Di Blas and Arun Jagota and Richard Hughey},
journal = {Journal of Heuristics},
year = {2003},
number = {3},
pages = {489--506},
volume = {9},
keywords = {graph coloring problem, local search methods, simple metaheuristics}
}
@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{DBLP:journals/dam/CaramiaD08,
title = {Coloring graphs by iterated local search traversing feasible and infeasible solutions},
author = {Massimiliano Caramia and Paolo Dell'Olmo},
journal = {Discrete Applied Mathematics},
year = {2008},
number = {2},
pages = {201-217},
volume = {156},
bibsource = {DBLP, http://dblp.uni-trier.de},
doi = {10.1016/j.dam.2006.07.013},
keywords = {graph coloring problem, local search methods, simple metaheuristics, large neighborhoods}
}
@article{CarDelIta07,
title = {CHECKCOL: Improved local search for graph coloringstar},
author = {Massimiliano Caramia and Paolo Dell'Olmo and Giuseppe F. Italiano},
journal = {Journal of Discrete Algorithms},
year = {2006},
number = {2},
pages = {277--298},
volume = {4},
doi = {doi:10.1016/j.jda.2005.03.006},
keywords = {graph coloring problem, local search methods, simple metaheuristics}
}
@incollection{Chiarandini2008a,
title = {Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems},
author = {Chiarandini, Marco and Dumitrescu, Irina and St{\"u}tzle, Thomas},
booktitle = {Hybrid Metaheuristics},
publisher = {Springer},
year = {2008},
editor = {Christian Blum and Maria J. Blesa and Andrea Roli and Michael Sampels},
pages = {117--150},
series = {Studies in Computational Intelligence},
volume = {114},
abstract = {Two key issues in local search algorithms are the definition of a neighborhood and the way to examine it. In this chapter we consider techniques for examining very large neighborhoods, in particular, ways for exactly searching them. We first illustrate such techniques using three paradigmatic examples. In the largest part of the chapter, we focus on the development and experimental study of very largescale neighborhood search algorithms for two coloring problems. The first example concerns the well-known (vertex) graph coloring problem. Despite initial promising results on the use of very large-scale neighborhoods, our final conclusion was negative: the usage of the proposed very large-scale neighborhoods did not help to improve the performance of effective stochastic local search algorithms. The second example, the graph set T-coloring problem, yielded more positive results. In this case, a very large-scale neighborhood that was specially tailored for this problem and that can be efficiently searched, resulted to be an essential component of a new state-of-the-art algorithm for various instance classes.},
doi = {10.1007/978-3-540-78295-7_5},
keywords = {graph coloring problem, local search methods, simple metaheuristics, large neighborhoods},
owner = {marco},
timestamp = {2009.03.23}
}
@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{Chiarandini2010f,
title = {An Analysis of Heuristics for Vertex Colouring},
author = {Chiarandini, Marco and St{\"u}tzle, Thomas},
booktitle = {Experimental Algorithms, Proceedings of the 9th International Symposium, (SEA 2010)},
year = {2010},
editor = {Paola Festa},
month = {May},
note = {Supplementary material and source code available at \url{http://www.imada.sdu.dk/~marco/gcp-study/}},
pages = {326--337},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {6049},
abstract = {Several heuristics have been presented in the literature for finding a proper colouring of the vertices of a graph using the least number of colours. These heuristics are commonly compared on a set of graphs that served two DIMACS competitions. This set does not permit the statistical study of relations between algorithm performance and structural features of graphs. We generate a new set of random graphs controlling their structural features and advance the knowledge of heuristics for graph colouring. We maintain and make all algorithms described here publically available in order to facilitate future comparisons.},
doi = {10.1007/978-3-642-13193-6_28},
keywords = {Chiarandini, graph coloring problem, simple metaheuristics, construction heuristics},
location = {Ischia Island, Naples, Italy, May 2010},
owner = {marco},
timestamp = {2010.07.06}
}
@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{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}
}
@article{DiBlas2002,
title = {Energy function-based approaches to graph coloring},
author = {Di Blas, A. and Jagota, A. and Hughey, R.},
journal = {Neural Networks, IEEE Transactions on},
year = {2002},
month = {jan},
number = {1},
pages = {81 -91},
volume = {13},
abstract = {We describe an approach to optimization based on a multiple-restart quasi-Hopfield network where the only problem-specific knowledge is embedded in the energy function that the algorithm tries to minimize. We apply this method to three different variants of the graph coloring problem: the minimum coloring problem, the spanning subgraph k-coloring problem, and the induced subgraph k-coloring problem. Though Hopfield networks have been applied in the past to the minimum coloring problem, our encoding is more natural and compact than almost all previous ones. In particular, we use k-state neurons while almost all previous approaches use binary neurons. This reduces the number of connections in the network from (Nk)2 to N2 asymptotically and also circumvents a problem in earlier approaches, that of multiple colors being assigned to a single vertex. Experimental results show that our approach compares favorably with other algorithms, even nonneural ones specifically developed for the graph coloring problem},
doi = {10.1109/72.977273},
issn = {1045-9227},
keywords = {graph coloring problem, simple metaheuristics, Hopfield neural networks;energy minimization;graph coloring;k-state neurons;multiple-restart;optimization;quasi-Hopfield network;simulated annealing;Hopfield neural nets;graph colouring;optimisation;}
}
@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{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}
}
@inproceedings{FabHog02,
title = {Graph Coloring with Quantum Heuristics},
author = {Alex Fabrikant and Tad Hogg},
booktitle = {Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, Edmonton, Alberta, Canada. AAAI Press},
year = {2002},
pages = {22--27},
keywords = {graph coloring problem, local search methods, simple metaheuristics}
}
@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{GenHerStL07,
title = {On edge orienting methods for graph coloring},
author = {Bernard Gendron and Alain Hertz and Patrick St-Louis},
journal = {Journal of combinatorial optimization},
year = {2007},
number = {2},
pages = {163--178},
volume = {13},
doi = {10.1007/s10878-006-9019-3},
keywords = {graph coloring problem, local search methods, simple metaheuristics, large neighborhoods}
}
@article{GlaPru05,
title = {A Polynomially Searchable Exponential Neighbourhood for Graph Colouring},
author = {C. A. Glass and Adam Pr{\"u}gel-Bennett},
journal = {Journal of the Operational Research Society},
year = {2005},
number = {3},
pages = {324--330},
volume = {56},
keywords = {graph coloring problem, local search}
}
@article{VelLag02,
title = {Tabu Search with Simple Ejection Chains for Coloring Graphs},
author = {J.L.~Gonz\'alez-Velarde and M.~Laguna},
journal = {Annals of Operations Research},
year = {2002},
number = {1-4},
pages = {165-174},
volume = {117},
keywords = {graph coloring problem, local search methods, simple metaheuristics}
}
@inproceedings{HamHao01:ss,
title = {Scatter Search for Graph Coloring},
author = {J.-P. Hamiez and J.-K. Hao},
booktitle = {Artificial Evolution},
year = {2001},
editor = {P. Collet and C. Fonlupt and J.-K. Hao and E. Lutton and M. Schoenauer},
pages = {168--179},
series = {Lecture Notes in Computer Science},
volume = {2310},
keywords = {graph coloring problem, local search methods, simple metaheuristics}
}
@inproceedings{HamHao01:a,
title = {Experimental Investigation of Scatter Search for Graph Coloring},
author = {J.-P. Hamiez and J.-K. Hao},
booktitle = {Proceedings of the Metaheuristics International Conference},
year = {2001},
address = {Porto, Portugal},
pages = {311--316},
keywords = {graph coloring problem, local search methods, simple metaheuristics}
}
@article{Her91,
title = {COSINE: A new graph coloring algorithm},
author = {A. Hertz},
journal = {Operations Research Letters},
year = {1991},
number = {7},
pages = {411--415},
volume = {10},
doi = {doi:10.1016/0167-6377(91)90043-O},
keywords = {graph coloring problem, local search methods, simple metaheuristics}
}
@article{HerDeW87,
title = {Using Tabu Search Techniques for Graph Coloring},
author = {A.~Hertz and D.~{de Werra}},
journal = {Computing},
year = {1987},
number = {4},
pages = {345--351},
volume = {39},
keywords = {graph coloring problem, local search methods, simple metaheuristics}
}
@article{Hertz2008,
title = {Variable Space Search for Graph Coloring},
author = {A. Hertz and M. Plumettaz and N. Zufferey},
journal = {Discrete Applied Mathematics},
year = {2008},
number = {13},
pages = {2551 -- 2560},
volume = {156},
doi = {10.1016/j.dam.2008.11.008},
keywords = {graph coloring problem, simple metaheuristics, local search},
owner = {marco},
timestamp = {2010.08.06}
}
@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}
}
@article{JohAraMcGSch91:or,
title = {Optimization by Simulated Annealing: An Experimental Evaluation; Part {II}, Graph Coloring and Number Partitioning},
author = {D. S. Johnson and C. R. Aragon and L. A. McGeoch and C.~Schevon},
journal = {Operations Research},
year = {1991},
number = {3},
pages = {378--406},
volume = {39},
file = {:home/marco/Literature/Applications/Coloring/johnson91.pdf:PDF},
keywords = {graph coloring problem, local search methods, simple metaheuristics, instances}
}
@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}
}
@article{KocGloBahReg05,
title = {An Unconstrained Quadratic Binary Approach to the Vertex Coloring Problem},
author = {Gary A. Kochenberger and Fred Glover and Bahram Alidaee and Cesar Rego},
journal = {Annals of Operations Research},
year = {2005},
number = {1},
pages = {229--241},
volume = {139},
keywords = {graph coloring problem, local search methods, simple metaheuristics}
}
@article{LagMar01,
title = {A {GRASP} for Coloring Sparse Graphs},
author = {Manuel Laguna and Rafael Mart\'i},
journal = {Computational optimization and applications},
year = {2001},
number = {2},
pages = {165--178},
volume = {19},
address = {Norwell, MA, USA},
doi = {10.1023/A:1011237503342},
issn = {0926-6003},
keywords = {graph coloring problem, local search methods, simple metaheuristics},
publisher = {Kluwer Academic Publishers}
}
@article{Lewis2009,
title = {A general-purpose hill-climbing method for order independent minimum gr ouping problems: A case study in graph colouring and bin packing},
author = {Rhyd Lewis},
journal = {Computers \& Operations Research},
year = {2009},
number = {7},
pages = {2295 - 2310},
volume = {36},
abstract = {A class of problems referred to as order independent minimum grouping problems i s examined and an intuitive hill-climbing method for solving such problems is pr oposed. Example applications of this generic method are made to two well-known p roblems belonging to this class: graph colouring and bin packing. Using a wide v ariety of different problem instance-types, these algorithms are compared to two other generic methods for this problem type: the iterated greedy algorithm and the grouping genetic algorithm. The results of these comparisons indicate that t he presented applications of the hill-climbing approach are able to significantl y outperform these algorithms in many cases. A number of reasons for these chara cteristics are given in the presented analyses.},
doi = {10.1016/j.cor.2008.09.004},
issn = {0305-0548},
keywords = {graph coloring problem, simple metaheuristics},
url = {http://www.sciencedirect.com/science/article/B6VC5-4TGHNJ4-1/2/1040b5ca8e f6fc2ddf012f32f3de9cb5}
}
@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{MorSha90,
title = {Coloration neighborhood structures for general graph coloring},
author = {C. Morgenstern and H. Shapiro},
booktitle = {Proceedings of the first annual {ACM-SIAM} Symposium on Discrete algorithms},
year = {1990},
pages = {226--235},
publisher = {Society for Industrial and Applied Mathematics, Philadelphia, PA, USA},
isbn = {0-89871-251-3},
keywords = {graph coloring problem, local search methods, simple metaheuristics},
location = {San Francisco, California, United States}
}
@inproceedings{OnoYagHir07,
title = {A vector assignment approach for the graph coloring problem},
author = {T. Ono and M. Yagiura and T. Hirata},
booktitle = {Proc. Learning and Intelligent OptimizatioN Conference (LION 2007 II)},
year = {2007},
address = {Trento, Italy},
note = {to appear as LNCS},
keywords = {graph coloring problem, local search methods, simple metaheuristics}
}
@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}
}
@phdthesis{Stu98:phd,
title = {Local Search Algorithms for Combinatorial Problems --- Analysis, Improvements, and New Applications},
author = {T. St{\"u}tzle},
school = {FB Informatik, Technische Universit{\"a}t Darmstadt, Darmstadt, Germany},
year = {1998},
keywords = {graph coloring problem, local search methods, simple metaheuristics}
}
@article{Talavan2008,
title = {The graph coloring problem: A neuronal network approach},
author = {Pedro M. Talav{\'a}n and Javier Y{\'a}{\~n}ez},
journal = {European Journal of Operational Research},
year = {2008},
number = {1},
pages = {100 - 111},
volume = {191},
doi = {DOI: 10.1016/j.ejor.2007.08.034},
issn = {0377-2217},
keywords = {graph coloring problem, simple metaheuristics, Artificial neural networks},
url = {http://www.sciencedirect.com/science/article/B6VCT-4PKXBRB-2/2/55e3768b11 3eff1004b2a4338461f0b0}
}
@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}
}
@proceedings{gecco2003:p,
title = {Genetic and Evolutionary Computation - GECCO 2003, Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003. Proceedings, Part I},
year = {2003},
editor = {Erick Cant{\'u}-Paz et al.},
publisher = {Springer Verlag, Berlin, Germany},
series = {Lecture Notes in Computer Science},
volume = {2723},
bibsource = {DBLP, http://dblp.uni-trier.de},
booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2003)},
isbn = {3-540-40602-6},
location = {Chicago, IL, USA},
opteditor = {and James A. Foster and Kalyanmoy Deb and Lawrence Davis and Rajkumar Roy and Una-May O'Reilly and Hans-Georg Beyer and Russell K. Standish and Graham Kendall and Stewart W. Wilson and Mark Harman and Joachim Wegener and Dipankar Dasgupta and Mitchell A. Potter and Alan C. Schultz and Kathryn A. Dowsland and Natasa Jonoska and Julian F. Miller}
}
@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}
}
@proceedings{DBLP:conf/ae/2007,
title = {Artificial Evolution, 8th International Conference, Evolution Artificielle, EA 2007, Tours, France, October 29-31, 2007, Revised Selected Papers},
year = {2008},
editor = {Nicolas Monmarch{\'e} and El-Ghazali Talbi and Pierre Collet and Marc Schoenauer and Evelyne Lutton},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {4926},
bibsource = {DBLP, http://dblp.uni-trier.de},
booktitle = {Artificial Evolution},
isbn = {978-3-540-79304-5}
}
@proceedings{DBLP:conf/cpaior/2007,
year = {2007},
editor = {Pascal {Van Hentenryck} and Laurence A. Wolsey},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {4510},
bibsource = {DBLP, http://dblp.uni-trier.de},
booktitle = {Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems},
isbn = {978-3-540-72396-7},
optbooktitle = {CPAIOR},
opttitile = {4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings}
}