Firma en Digital.CSIC (*)
Blum, Christian
 
Centro o Instituto
CSIC - Instituto de Investigación en Inteligencia artificial (IIIA)
 
Departamento
Departamento de Razonamiento y Lógica
 
Categoría Profesional
Staff científico
 
Especialización
Inteligencia Artificial
 
Email
christian.blum@iiia.csic.es
 
 
Perfil en Google Scholar
 
 
 

Results 1-20 of 35 (Search time: 0.048 seconds).

RightsPreviewIssue DateTitleAuthor(s)Type
1closedAccessaccesoRestringido.pdf.jpg2020A comparative analysis of two matheuristics by means of merged local optima networksBlum, Christian CSIC ORCID ; Ochoa, G.artículo
2closedAccessaccesoRestringido.pdf.jpgJun-2018A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problemBlum, Christian CSIC ORCID ; Blesa, Maria J.artículo
3openAccessBistaffaEtAl2019T-ITS.pdf.jpgNov-2019A Computational Approach to Quantify the Benefits of Ridesharing for Policy Makers and TravellersBistaffa, Filippo CSIC ORCID ; Blum, Christian CSIC ORCID ; Cerquides, Jesús CSIC ORCID ; Farinelli, Alessandro; Rodríguez-Aguilar, Juan Antonio CSIC ORCID artículo
4openAccessalgorithms-14-00170.pdf.jpg2021A Greedy Heuristic for Maximizing the Lifetime of Wireless Sensor Networks Based on Disjoint Weighted Dominating SetsBalbal, Samir; Bouamama, Salim; Blum, Christian CSIC ORCID artículo
5closedAccessaccesoRestringido.pdf.jpgMay-2016A hybrid algorithmic model for the minimum weight dominating set problemBlum, Christian CSIC ORCID ; Bouamama, Salimartículo
6embargoedAccessaccesoRestringido.pdf.jpg2020A new optimization model for wastewater treatment planning with a temporal componentBlum, Christian CSIC ORCID ; Verdaguer, Marta; Monclús, H.; Poch, M.artículo
72021Adding Negative Learning to Ant Colony Optimization: A Comprehensive StudyNurcahyadi, Teddy; Blum, Christian CSIC ORCID artículo
8openAccessipl_2021_blum.pdf.jpg2021An A* search algorithm for the constrained longest common subsequence problemDjukanovic, Marco; Berger, Christoph; Raidl, Günther R; Blum, Christian CSIC ORCID artículo
9openAccessipl_2021_blum.pdf.jpg2021An A* search algorithm for the constrained longest common subsequence problemDjukanovic, Marco; Berger, Christoph; Raidl, Günther R; Blum, Christian CSIC ORCID artículo
10closedAccessaccesoRestringido.pdf.jpgJul-2019An algorithm based on ant colony optimization for the minimum connected dominating set problemBouamama, Salim; Blum, Christian CSIC ORCID ; Fages, Jean-Guillaumeartículo
11openAccessalgorithms-14-00079-v2.pdf.jpg2021An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social NetworksBouamama, Salim; Blum, Christian CSIC ORCID artículo
12openAccessalgorithms-14-00079-v2.pdf.jpg2021An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social NetworksBouamama, Salim; Blum, Christian CSIC ORCID artículo
13embargoedAccessaccesoRestringido.pdf.jpg2020Anytime algorithms for the longest common palindromic subsequence problemDjukanovic, Marco; Raidl, Gunther; Blum, Christian CSIC ORCID artículo
14openAccessA Hybrid Evolutionary Algorithm for Minimum Capacitated Dominating Set Problem BLUM.pdf.jpg2020Barrakuda: A Hybrid Evolutionary Algorithm for Minimum Capacitated Dominating Set ProblemPedro Pinacho-Davidson; Blum, Christian CSIC ORCID artículo
15closedAccessaccesoRestringido.pdf.jpg2016Computational performance evaluation of two integer linear programming models for the minimum common string partition problemBlum, Christian CSIC ORCID ; Raidl, Güntherartículo
16closedAccessaccesoRestringido.pdf.jpg2-Nov-2015Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimizationBlum, Christian CSIC ORCID ; Pinacho Davidson, Pedro ; López-Ibáñez, Manuel; Lozano, José Aartículo
17closedAccessaccesoRestringido.pdf.jpg20-Apr-2017Construct, 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
18embargoedAccessaccesoRestringido.pdf.jpg2020Finding Longest Common Subsequences: New anytime A∗ search resultsDjukanovic, Marco; Raidl, Gunther; Blum, Christian CSIC ORCID artículo
19closedAccessaccesoRestringido.pdf.jpg2018Hybrid techniques based on solving reduced problem instances for a longest common subsequence problemBlum, Christian CSIC ORCID ; Blesa, Maria J.artículo
20closedAccessaccesoRestringido.pdf.jpg3-Oct-2017ILP-Based Reduced Variable Neighborhood Search for Large-Scale Minimum Common String PartitionBlum, Christian CSIC ORCID artículo