journals.bib
@comment{{This file has been generated by bib2bib 1.96}}
@comment{{Command line: /usr/bin/bib2bib --expand -ob journals.bib -oc journals-list.bib ../all-entries.bib -c '(author:"Chiarandini") and ($type="ARTICLE")'}}
@article{Bang-Jensen2009,
author = {J{\o}rgen Bang-Jensen and Marco Chiarandini and Peter Morling},
title = {A Computational Investigation of Heuristic Algorithms for 2-Edge-Connectivity
Augmentation},
journal = {Networks},
year = {2010},
volume = {55},
pages = {299 -- 325},
number = {4},
month = {February},
note = {Supplementary material available at \url{http://www.imada.sdu.dk/~marco/e12aug/}.
Preliminary version available as \emph{Tech.\ Rep.} DMF-2007-07-005
at The Danish Mathematical Society},
doi = {10.1002/net.20316},
optjournal = {Networks},
opturl = {http://bib.mathematics.dk/preprint.php?id=DMF-2007-07-005},
publisher = {John Wiley \& Sons Inc},
url = {Files/BanChiMor2008.pdf}
}
@article{BasChiSal05,
author = {D. Basso and M. Chiarandini and L. Salmaso},
title = {Synchronized Permutation Tests in {IxJ} Designs},
journal = {Journal of Statistical Planning and Inference},
year = {2007},
volume = {137},
pages = {2564--2578},
number = {8},
month = {August},
doi = {10.1016/j.jspi.2006.04.016},
keywords = {Chiarandini, experimental design}
}
@article{BiaBirChiManMasPaqRosSch05,
author = {L. Bianchi and M. Birattari and M. Chiarandini and M. Manfrin and
M. Mastrolilli and L. Paquete and O. Rossi-Doria and T. Schiavinotto},
title = {Hybrid Metaheuristics for the vehicle routing problem with stochastic
demand},
journal = {Journal of Mathematical Modelling and Algorithms},
year = {2006},
volume = {5},
pages = {91--110},
number = {1},
month = {April},
doi = {10.1007/s10852-005-9033-y},
keywords = {Chiarandini},
optnote = {A preliminary version is available as Technical Report IDSIA-06-05.},
opturl = {Files/IDSIA-06-05.pdf}
}
@article{ChiBirSocRos04,
author = {M. Chiarandini and M. Birattari and K. Socha and O. Rossi-Doria},
title = {An Effective Hybrid Algorithm for University Course Timetabling},
journal = {Journal of Scheduling},
year = {2006},
volume = {9},
pages = {403--432},
number = {5},
month = {October},
doi = {10.1007/s10951-006-8495-8},
keywords = {Chiarandini}
}
@article{Chiarandini2011,
author = {Chiarandini, Marco and Di Gaspero, Luca and Gualandi, Stefano and
Schaerf, Andrea},
title = {The balanced academic curriculum problem revisited},
journal = {Journal of Heuristics},
year = {2012},
volume = {18},
pages = {119-148},
number = {1},
abstract = {The Balanced Academic Curriculum Problem (BACP) consists in assigning
courses to teaching terms satisfying prerequisites and balancing
the credit course load within each term. The BACP is part of the
CSPLib with three benchmark instances, but its formulation is simpler
than the problem solved in practice by universities. In this article,
we introduce a generalized version of the problem that takes different
curricula and professor preferences into account, and we provide
a set of real-life problem instances arisen at University of Udine.
Since the existing formulation based on a min-max objective function
does not balance effectively the credit load for the new instances,
we also propose alternative objective functions. Whereas all the
CSPLib instances are efficiently solved with Integer Linear Programming
(ILP) state-of-the-art solvers, our new set of real-life instances
turns out to be much more challenging and still intractable for ILP
solvers. Therefore, we have designed, implemented, and analyzed heuristics
based on local search. We have collected computational results on
all the new instances with the proposed approaches and assessed the
quality of solutions with respect to the lower bounds found by ILP
on a relaxed and decomposed problem. Results show that a selected
heuristic finds solutions of quality at 9%-60% distance from the
lower bound. We make all data publicly available, in order to stimulate
further research on this problem.},
affiliation = {IMADA, University of Southern Denmark, Campusvej 55, 5000 Odense,
Denmark},
doi = {10.1007/s10732-011-9158-2},
issn = {1381-1231},
keyword = {Computer Science},
optnote = {Online first},
publisher = {Springer Netherlands}
}
@article{Chiarandini2013,
author = {Chiarandini, Marco and Kjeldsen, Niels and Nepomuceno, Napole\~{a}o},
title = {Integrated planning of biomass inventory and energy production},
journal = {IEEE Transactions on Computers},
year = {2013},
note = {In press},
keywords = {Chiarandini},
owner = {marco},
timestamp = {2012.09.26}
}
@article{ChiKosKouPaq08,
author = {Marco Chiarandini and Ilias S. Kotsireas and Christos Koukouvinos
and Lu\'is Paquete},
title = {Heuristic algorithms for {Hadamard} matrices with two circulant cores},
journal = {Theoretical Computer Science},
year = {2008},
volume = {407},
pages = {274-277},
note = {Code \url{http://www.imada.sdu.dk/~marco/Hadamards/ts.c}},
abstract = {We design heuristic algorithms to construct Hadamard matrices with
two circulant cores. This hard combinatorial problem can be formulated
in terms of objective functions of several binary variables, so that
heuristic methodologies can be used. Our algorithms are based on
local and tabu search and they use information on the geometry of
the objective function landscapes. In addition, we use the supplementary
difference sets formalism to detect when solutions of a special structure
exist. Using these algorithms we have computed at least one Hadamard
matrix with two circulant cores of the sixteen orders 56, 60, 64,
68, 72, 76, 80, 84, 88, 92, 96, 100, 104, 108, 112, 116. In particular,
the Hadamard matrix with two circulant cores of order 116 is constructed
here for the first time, indeed it was accidentally reported as known
in an earlier paper.},
doi = {10.1016/j.tcs.2008.06.002},
file = {:home/marco/Literature/Mines/TCS6978.pdf:PDF},
keywords = {Hadamard matrices; Heuristic algorithms}
}
@article{ChiStu07,
author = {Marco Chiarandini and Thomas St{\"u}tzle},
title = {Stochastic Local Search Algorithms for Graph Set {T}-Colouring and
Frequency Assignment},
journal = {Constraints},
year = {2007},
volume = {12},
pages = {371-403},
number = {3},
month = {September},
doi = {10.1007/s10601-007-9023-y}
}
@article{Kjeldsen2012,
author = {Niels Hvidberg Kjeldsen and Marco Chiarandini},
title = {Heuristic Solutions to the Long-Term Unit Commitment Problem with
Cogeneration Plants},
journal = {Computers \& Operations Research},
year = {2012},
volume = {39},
pages = {269--282},
number = {2},
doi = {10.1016/j.cor.2011.03.018},
issue = {2},
keywords = {Chiarandini},
owner = {marco},
timestamp = {2009.08.17}
}