collections.bib
@comment{{This file has been generated by bib2bib 1.99}}
@comment{{Command line: bib2bib --expand -ob collections.bib -oc collections-list.bib ../all-entries.bib -c '(author:"Chiarandini") and ($type="INCOLLECTION" | $type="INBOOK")'}}
@incollection{Bartz-Beielstein2010a,
author = {Thomas Bartz-Beielstein and Marco Chiarandini and Lu{\'i}s Paquete
and Mike Preuss},
title = {Introduction},
booktitle = {Experimental Methods for the Analysis of Optimization Algorithms},
publisher = {Springer},
year = {2010},
editor = {Thomas Bartz-Beielstein and Marco Chiarandini and Lu{\'i}s Paquete
and Mike Preuss},
pages = {1--14},
address = {Germany},
doi = {10.1007/978-3-642-02538-9},
optbooktitle = {Experimental Methods for the Analysis of Optimization Algorithms},
optedition = {1st},
optpages = {457},
owner = {marco},
timestamp = {2009.05.11}
}
@incollection{Chiarandini2008a,
author = {Chiarandini, Marco and Dumitrescu, Irina and St{\"u}tzle, Thomas},
title = {Very Large-Scale Neighborhood Search: Overview and Case Studies on
Coloring Problems},
booktitle = {Hybrid Metaheuristics},
publisher = {Springer},
year = {2008},
editor = {Christian Blum and Maria J. Blesa and Andrea Roli and Michael Sampels},
volume = {114},
series = {Studies in Computational Intelligence},
pages = {117--150},
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}
}
@incollection{ChiStuDum05,
author = {M. Chiarandini and I. Dumitrescu and T. St\"utzle},
title = {Stochastic Local Search Algorithms for the Graph Colouring Problem},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics},
publisher = {Chapman \& Hall/CRC},
year = {2007},
editor = {T~.F.~Gonzalez},
series = {Computer \& Information Science Series},
pages = {63.1--63.17},
address = {Boca Raton, FL, USA},
note = {Preliminary version available as \emph{Tech.~Rep.}~AIDA-05-03 at
Intellectics Group, Computer Science Department, Darmstadt University
of Technology, Darmstadt, Germany},
keywords = {Chiarandini, graph coloring problem, surveys},
url = {Files/AIDA-05-03.pdf}
}
@incollection{Chiarandini2010,
author = {Marco Chiarandini and Yuri Goegebeur},
title = {Mixed Models for the Analysis of Optimization Algorithms},
booktitle = {Experimental Methods for the Analysis of Optimization Algorithms},
publisher = {Springer},
year = {2010},
editor = {Thomas Bartz-Beielstein and Marco Chiarandini and Lu{\'i}s Paquete
and Mike Preuss},
pages = {225--264},
address = {Germany},
note = {Preliminary version available as \emph{Tech.\ Rep.}~DMF-2009-07-001
at the The Danish Mathematical Society},
doi = {10.1007/978-3-642-02538-9},
optbooktitle = {Experimental Methods for the Analysis of Optimization Algorithms},
optedition = {1st},
optpages = {457},
opturl = {http://www.springer.com/computer/ai/book/978-3-642-02537-2},
optyear = {2010},
owner = {marco},
timestamp = {2009.05.08},
url = {http://bib.mathematics.dk/preprint.php?id=DMF-2009-07-001}
}
@incollection{Paq04,
author = {Luis Paquete and Marco Chiarandini and Thomas St\"utzle},
title = {Pareto local optimum sets in the biobjective traveling salesman problem:
An experimental study},
booktitle = {Metaheuristics for Multiobjective Optimisation},
publisher = {Springer Verlag, Berlin, Germany},
year = {2004},
editor = {X. Gandibleux and M. Sevaux and K. S\"orensen and V. T'kindt},
volume = {535},
series = {Lecture Notes in Economics and Mathematical Systems},
pages = {177--200},
keywords = {Chiarandini},
opturl = {http://eden.dei.uc.pt/~paquete/papers/momh2004.pdf}
}
@incollection{olivia02:bis,
author = {O. Rossi-Doria and M. Samples and M. Birattari and M. Chiarandini
and M. Dorigo and L. Gambardella and J. Knowles and M. Manfrin and
M. Mastrolilli and B. Paechter and L. Paquete and T. St\"utzle},
title = {A Comparison of the Performance of Different Metaheuristics on the
Timetabling Problem},
booktitle = {Practice and Theory of Automated Timetabling},
publisher = {Springer},
year = {2003},
editor = {E. Burke and P. Causmaecker},
volume = {2740},
series = {Lecture Notes in Computer Science},
pages = {329--351},
doi = {10.1007/b11828},
keywords = {Chiarandini},
optbooktitle = {4th International Conference, PATAT 2002},
optcrossref = {patat2002},
optnote = {Extended abstract available on the Proceedings of PATAT 2002, pages
115-119},
opturl = {Files/olivia-paechter-02.pdf}
}
@comment{{jabref-meta: databaseType:biblatex;}}
@comment{{jabref-meta: grouping:
0 AllEntriesGroup:;
1 StaticGroup:Markings\;2\;1\;\;\;\;;
2 StaticGroup:[marco]\;2\;1\;\;\;\;;
}}
@incollection{DBLP:books/tf/18/ChiarandiniDS18,
author = {Marco Chiarandini and
Irina Dumitrescu and
Thomas St{\"{u}}tzle},
editor = {Teofilo F. Gonzalez},
title = {Stochastic Local Search Algorithms for the Graph Colouring Problem},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
Volume 2: Contemporary and Emerging Applications},
publisher = {Chapman and Hall/CRC},
year = {2018},
timestamp = {Mon, 28 Oct 2019 16:49:19 +0100},
biburl = {https://dblp.org/rec/books/tf/18/ChiarandiniDS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}