Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Sergio Cavero"'
Publikováno v:
European Journal of Operational Research. 306:1126-1139
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3ef413bf932665d749259ce895db31c
https://doi.org/10.1016/j.ejor.2022.09.004
https://doi.org/10.1016/j.ejor.2022.09.004
Autor:
Raúl, Martín-Santamaría, Sergio, Cavero, Alberto, Herrán, Abraham, Duarte, J Manuel, Colmenar
Publikováno v:
Evolutionary Computation. :1-35
Reproducibility of experiments is a complex task in stochastic methods such as evolutionary algorithms or metaheuristics in general. Many works from the literature give general guidelines to favor reproducibility. However, none of them provide both a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a05b8e0e5f7d0f087b21c9588e4bef95
https://doi.org/10.1162/evco_a_00317
https://doi.org/10.1162/evco_a_00317
Publikováno v:
Computational Optimization and Applications. 81:657-687
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95d314139db5bd3003c44a4f1da7837a
https://doi.org/10.1007/s10589-021-00334-y
https://doi.org/10.1007/s10589-021-00334-y
Publikováno v:
Variable Neighborhood Search ISBN: 9783031344992
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6b33c372cb9bab7c26c38112a0a1692a
https://doi.org/10.1007/978-3-031-34500-5_7
https://doi.org/10.1007/978-3-031-34500-5_7
Publikováno v:
Knowledge-Based Systems. 246:108680
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3dbf453f3df45551377a2452abc68b4c
https://doi.org/10.1016/j.knosys.2022.108680
https://doi.org/10.1016/j.knosys.2022.108680
Publikováno v:
Advances in Artificial Intelligence ISBN: 9783030857127
CAEPIA
CAEPIA
The quality of the solutions to a combinatorial optimization problem is usually measured using a mathematical function, named objective function. This function is also used to guide heuristic procedures through the solution space, helping to detect p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92d02632076e786c87bb9307814d6c99
https://doi.org/10.1007/978-3-030-85713-4_14
https://doi.org/10.1007/978-3-030-85713-4_14
Publikováno v:
Computers & Operations Research. 126:105116
The Cyclic Cutwidth Minimization Problem (CCMP) is a Graph Layout Problem that consists of finding an embedding of the vertices of a candidate graph in a host graph, in order to minimize the maximum cut of a host edge. In this case, the host graph is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2ed92690c7a2c9b6bb52ba9e9f86d89
https://doi.org/10.1016/j.cor.2020.105116
https://doi.org/10.1016/j.cor.2020.105116