English
español
Navegación por Autor Blesa, Maria J.
Mostrando resultados 1 a 9 de 9
| Derechos | Preview | Fecha Public. | Título | Autor(es) | Tipo |
| closedAccess |  | jun-2018 | A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem | Blum, Christian CSIC ORCID ; Blesa, Maria J. | artículo |
| closedAccess |  | 6-jun-2017 | A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem | Blum, Christian CSIC ORCID ; Blesa, Maria J. | comunicación de congreso |
| openAccess |  | 1-dic-2021 | ANTS 2020 Special Issue: Editorial | Dorigo, Marco; Stützle, Thomas; Blesa, Maria J.; Blum, Christian CSIC ORCID ; Hamann, Heiko; Heinrich, Mary Katherine | artículo |
| closedAccess |  | 20-abr-2017 | Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: Which one works better when? | Lizarraga, Evelia; Blesa, Maria J.; Blum, Christian CSIC ORCID | artículo |
| closedAccess |  | 2018 | Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem | Blum, Christian CSIC ORCID ; Blesa, Maria J. | artículo |
| closedAccess |  | 2017 | Large neighborhood search for the most strings with few bad columns problem | Lizarraga, Evelia; Blesa, Maria J.; Blum, Christian CSIC ORCID ; Raidl, Günther | artículo |
| closedAccess |  | 8-jul-2022 | Negative learning Ant colony optimization for network alignment | Rodríguez-Corominas, Guillem CSIC ORCID; Blum, Christian CSIC ORCID ; Blesa, Maria J. | comunicación de congreso |
| closedAccess |  | 2018 | On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization | Blesa, Maria J.; Blum, Christian CSIC ORCID | capítulo de libro |
| closedAccess |  | 2020 | Swarm Intelligence | Dorigo, Marco; Stützle, Thomas; Blesa, Maria J.; Blum, Christian CSIC ORCID ; Hamann, H; Heinrich, M.K.; Strobel, Volker | libro |
