Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Luca Di Gaspero"'
Publikováno v:
Journal of the Operational Research Society. 70:1039-1050
The thesis defense timetabling problem consists in composing the suitable committee for a set of defense sessions and assigning each graduation candidate to one of the sessions.In this work, we define the problem formulation that applies to some Ital
Publikováno v:
Energies
Volume 13
Issue 23
Pages: 6214
Energies, Vol 13, Iss 6214, p 6214 (2020)
Volume 13
Issue 23
Pages: 6214
Energies, Vol 13, Iss 6214, p 6214 (2020)
In recent years, cold food chains have shown an impressive growth, mainly due to customers life style changes. Consequently, the transportation of refrigerated food is becoming a crucial aspect of the chain, aiming at ensuring efficiency and sustaina
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04077186480ec8ddba48948a3afc02de
http://hdl.handle.net/11390/1194047
http://hdl.handle.net/11390/1194047
Publikováno v:
Hybrid Metaheuristics ISBN: 9783642306709
Hybrid Metaheuristics
Hybrid Metaheuristics
We present a general tool for encoding and solving optimization problems. Problems can be modeled using several paradigms and/or languages such as: Prolog, MiniZinc, and GECODE. Other paradigms can be included. Solution search is performed by a hybri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13c813ba07a49e3262e358256cd09c51
https://doi.org/10.1007/978-3-642-30671-6_15
https://doi.org/10.1007/978-3-642-30671-6_15
Autor:
Andrea Roli, Luca Di Gaspero
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642111686
LION
LION
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This information allows researchers to perform association studies for the g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c762cd7389c43c4dadaf2ee43a47b6b8
http://hdl.handle.net/11585/85747
http://hdl.handle.net/11585/85747
Publikováno v:
Hybrid Metaheuristics ISBN: 9783642049170
Hybrid Metaheuristics
Scopus-Elsevier
Hybrid Metaheuristics
Scopus-Elsevier
We present a hybrid solver (called $\mathbb{GELATO}$) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal + + ). $\mathbb{GELATO}$ allows to easily develop and use hybri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a16e1c9bd5b20d596b355bc59807517c
http://hdl.handle.net/11390/864460
http://hdl.handle.net/11390/864460
Publikováno v:
Ant Colony Optimization and Swarm Intelligence ISBN: 9783540875260
ANTS Conference
ANTS Conference
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This information enables researchers to perform association studies for the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b67b14898310d34ed18850200fb4b9b
http://hdl.handle.net/11390/882762
http://hdl.handle.net/11390/882762
Autor:
Andrea Schaerf, Luca Di Gaspero
Publikováno v:
Hybrid Metaheuristics ISBN: 9783540884385
Hybrid Metaheuristics
Hybrid Metaheuristics
The Balanced Academic Curriculum Problem (BACP) consists in assigning courses to teaching periods satisfying prerequisites and balancing students' load. BACP is included in CSPlib along with three benchmark instances. However, the BACP formulation in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41976fb77e6897d917c86f9348181c29
http://hdl.handle.net/11390/880700
http://hdl.handle.net/11390/880700
Autor:
Luca Di Gaspero, Andrea Roli
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This information allows researchers to perform association studies for the g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::501b263b2426f964f96d53c75df7e223
http://hdl.handle.net/11390/881186
http://hdl.handle.net/11390/881186
Autor:
Andrea Schaerf, Luca Di Gaspero
Publikováno v:
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics ISBN: 9783540744450
SLS
SLS
We present a software tool, called EASYSYN++, for the automatic synthesis of the source code for a set of stochastic local search (SLS) algorithms. EASYSYN++ uses C++ as object language and relies on EASYLOCAL++, a C++ framework for the development o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f620a73692348195ee934512f11754f
http://hdl.handle.net/11390/883838
http://hdl.handle.net/11390/883838
Publikováno v:
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics ISBN: 9783540744450
SLS
SLS
One of the aspects of applying software engineering to Stochastic Local Search (SLS) is the principled analysis of the features of the problem instances and the behavior of SLS algorithms, which --because of their stochastic nature-- might need sophi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0d9d35011b0e75754710e9d8a68b92b
https://doi.org/10.1007/978-3-540-74446-7_6
https://doi.org/10.1007/978-3-540-74446-7_6