hybridmeta.bib
@comment{{This file has been generated by bib2bib 1.95}}
@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,
author = {Charles Fleurent and Jacques Ferland},
title = {Object-oriented implementation of heuristics search methods for Graph
Coloring, Maximum Clique, and Satisfiability},
pages = {619--652},
crossref = {dimacs96},
keywords = {graph coloring problem, local search methods, hybrid metaheuristics}
}
@incollection{Lew96,
author = {G. Lewandowski and A. Condon},
title = {Experiments with parallel graph coloring heuristics and applications
of graph coloring},
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,
author = {Ivo Bl\"ochliger and Nicolas Zufferey},
title = {A Reactive Tabu Search Using Partial Solutions for the Graph Coloring
Problem},
booktitle = {Coloring graphs from lists with bounded size of their union: result
from Dagstuhl Seminar 03391},
year = {2003},
editor = {Daniel Kral and Jiri Sgall},
volume = {156},
series = {ITI-Series},
address = {Department of Applied Mathematics and Institute for Theoretical Computer
Science, Prague},
keywords = {graph coloring problem, local search methods, hybrid metaheuristics}
}
@techreport{Cul92,
author = {J.C. Culberson},
title = {Iterated Greedy Graph Coloring and the Difficulty Landscape},
institution = {Department of Computing Science, The University of Alberta, Edmonton,
Alberta, Canada},
year = {1992},
number = {92-07},
month = jun,
keywords = {graph coloring problem, local search methods, hybrid metaheuristics,
empirical analyses}
}
@article{DiSc03,
author = {Luca {Di Gaspero} and Andrea Schaerf},
title = {\textsc{EasyLocal++}: An object-oriented framework for flexible design
of local search algorithms},
journal = {Software --- Practice \& Experience},
year = {2003},
volume = {33},
pages = {733--765},
number = {8},
month = {July},
keywords = {graph coloring problem, local search methods, hybrid metaheuristics},
opturl = {http://www.diegm.uniud.it/satt/papers/DiSc03.pdf}
}
@article{FunHig00,
author = {Nobuo Funabiki and Teruo Higashino},
title = {A minimal-state processing search algorithm for graph coloring problems},
journal = {IEICE Transactions on Fundamentals},
year = {2000},
volume = {E83-A},
pages = {1420--1430},
number = {7},
keywords = {graph coloring problem, local search methods, hybrid metaheuristics}
}
@article{DBLP:journals/dam/GalinierHZ08,
author = {Philippe Galinier and Alain Hertz and Nicolas Zufferey},
title = {An adaptive memory algorithm for the $k$-coloring problem},
journal = {Discrete Applied Mathematics},
year = {2008},
volume = {156},
pages = {267-279},
number = {2},
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,
author = {Arun Jagota},
title = {An adaptive, multiple restarts neural network algorithm for graph
coloring},
journal = {European Journal of Operational Research},
year = {1996},
volume = {93},
pages = {257--270},
number = {2},
keywords = {graph coloring problem, local search methods, hybrid metaheuristics}
}
@inproceedings{KirPot98,
author = {Darko Kirovski and Miodrag Potkonjak},
title = {Efficient coloring of a large spectrum of graphs},
booktitle = {DAC '98: Proceedings of the 35th annual conference on Design automation},
year = {1998},
pages = {427--432},
address = {New York, NY, USA},
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,
author = {L. Paquete and T. St\"utzle},
title = {An Experimental Investigation of Iterated Local Search for Coloring
Graphs},
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},
volume = {2279},
series = {Lecture Notes in Computer Science},
pages = {122--131},
keywords = {graph coloring problem, local search methods, hybrid metaheuristics},
optaddress = {Berlin, Germany}
}
@techreport{Wal01,
author = {C. Walshaw},
title = {A Multilevel Approach to the Graph Colouring Problem},
institution = {School of Computing and Mathematical Science, Univeristy of Greenwich,
London, UK},
year = {2001},
number = {01/IM/69},
month = {May},
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,
author = {Qinghua Wu and Jin-Kao Hao},
title = {Coloring large graphs based on independent set extraction},
journal = {Computers \& Operations Research},
year = {2012},
volume = {39},
pages = {283 - 290},
number = {2},
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},
publisher = {American Mathematical Society, Providence, RI, USA},
year = {1996},
editor = {David S. Johnson and Michael Trick},
volume = {26},
series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
keywords = {graph coloring problem, surveys}
}