Christian Blum

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 95

Top Venues

Brussels, Univ. (PHD)

Education History

Brussels, Univ.

PHD

Publications

Camilo Chacón Sartori, Christian Blum, Gabriela Ochoa
Large Language Models for the Automated Analysis of Optimization Algorithms. CoRR (2024)
Roberto Maria Rosati, Salim Bouamama, Christian Blum
Multi-constructor CMSA for the maximum disjoint dominating sets problem. Comput. Oper. Res. 161 (2024)
Guillem Rodríguez Corominas, Maria J. Blesa, Christian Blum
AntNetAlign - A software package for Network Alignment. Softw. Impacts 15 (2023)
Camilo Chacón Sartori, Christian Blum, Gabriela Ochoa
STNWeb: A new visualization tool for analyzing optimization algorithms. Softw. Impacts 17 (2023)
Jairo Enrique Ramírez Sánchez, Camilo Chacón Sartori, Christian Blum
Q-Learning Ant Colony Optimization supported by Deep Learning for Target Set Selection. GECCO (2023)
Mehmet Anil Akbay, Can Berk Kalayci, Christian Blum
Application of Adapt-CMSA to the Two-Echelon Electric Vehicle Routing Problem with Simultaneous Pickup and Deliveries. EvoCOP (2023)
Christian Blum, Pedro Pinacho Davidson
Application of Negative Learning Ant Colony Optimization to the Far from Most String Problem. EvoCOP (2023)
Camilo Chacón Sartori, Christian Blum, Gabriela Ochoa
Search Trajectory Networks Meet the Web: A Web Application for the Visual Comparison of Optimization Algorithms. ICSCA (2023)
Marko Djukanovic, Aleksandar Kartelj, Christian Blum
Self-adaptive CMSA for solving the multidimensional multi-way number partitioning problem. Expert Syst. Appl. 232 (2023)
Guillem Rodríguez Corominas, Maria J. Blesa, Christian Blum
AntNetAlign: Ant Colony Optimization for Network Alignment. Appl. Soft Comput. 132 (2023)
Roberto Maria Rosati, Lucas Kletzander, Christian Blum, Nysret Musliu, Andrea Schaerf
Construct, Merge, Solve and Adapt Applied to a Bus Driver Scheduling Problem with Complex Break Constraints. AI*IA (2022)
Marko Djukanovic, Dragan Matic, Christian Blum, Aleksandar Kartelj
to the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings. ICPRAI (2) (2022)
Roberto Maria Rosati, Salim Bouamama, Christian Blum
Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem. MIC (2022)
Jon Pérez, Jose Luis Flores, Christian Blum, Jesús Cerquides, Alex Abuin
Optimization Techniques and Formal Verification for the Software Design of Boolean Algebra Based Safety-Critical Systems. IEEE Trans. Ind. Informatics 18 (1) (2022)
Dhananjay R. Thiruvady, Su Nguyen, Christian Blum, Andreas T. Ernst
An Efficient Merge Search Matheuristic for Maximising the Net Present Value of Project Schedules. CoRR (2022)
Teddy Nurcahyadi, Christian Blum, Felip Manyà
Negative Learning Ant Colony Optimization for MaxSAT. Int. J. Comput. Intell. Syst. 15 (1) (2022)
Mehmet Anil Akbay, Can Berk Kalayci, Christian Blum
Application of CMSA to the Electric Vehicle Routing Problem with Time Windows, Simultaneous Pickup and Deliveries, and Partial Vehicle Charging. MIC (2022)
Mehmet Anil Akbay, Albert López Serrano, Christian Blum
A Self-Adaptive Variant of CMSA: Application to the Minimum Positive Influence Dominating Set Problem. Int. J. Comput. Intell. Syst. 15 (1) (2022)
Camilo Chacón Sartori, Christian Blum
Boosting a Genetic Algorithm with Graph Neural Networks for Multi-Hop Influence Maximization in Social Networks. FedCSIS (2022)
Marko Djukanovic, Aleksandar Kartelj, Dragan Matic, Milana Grbic, Christian Blum, Günther R. Raidl
Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences. Appl. Soft Comput. 122 (2022)
Christian Blum, Anton V. Eremeev, Julia V. Kovalenko
Hybridizations of evolutionary algorithms with Large Neighborhood Search. Comput. Sci. Rev. 46 (2022)
Albert López Serrano, Christian Blum
A biased random key genetic algorithm applied to target set selection in viral marketing. GECCO (2022)
Guillem Rodríguez Corominas, Christian Blum, Maria J. Blesa
Negative learning Ant colony optimization for network alignment. GECCO (2022)
Christian Blum, Tome Eftimov, Peter Korosec
Preface. Nat. Comput. 21 (2) (2022)
Salim Bouamama, Christian Blum, Pedro Pinacho Davidson
A Population-Based Iterated Greedy Algorithm for Maximizing Sensor Network Lifetime. Sensors 22 (5) (2022)
Christian Blum, Gabriela Ochoa
A comparative analysis of two matheuristics by means of merged local optima networks. Eur. J. Oper. Res. 290 (1) (2021)
Salim Bouamama, Christian Blum
An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks. Algorithms 14 (3) (2021)
Teddy Nurcahyadi, Christian Blum
Negative Learning in Ant Colony Optimization: Application to the Multi Dimensional Knapsack Problem. ISMSI (2021)
Albert López Serrano, Teddy Nurcahyadi, Salim Bouamama, Christian Blum
Negative learning ant colony optimization for the minimum positive influence dominating set problem. GECCO Companion (2021)
Marco Dorigo, Thomas Stützle, Maria J. Blesa, Christian Blum, Heiko Hamann, Mary Katherine Heinrich
ANTS 2020 Special Issue: Editorial. Swarm Intell. 15 (4) (2021)
Gabriela Ochoa, Katherine M. Malan, Christian Blum
Search trajectory networks: A tool for analysing and visualising the behaviour of metaheuristics. Appl. Soft Comput. 109 (2021)
Samir Balbal, Salim Bouamama, Christian Blum
A Greedy Heuristic for Maximizing the Lifetime of Wireless Sensor Networks Based on Disjoint Weighted Dominating Sets. Algorithms 14 (6) (2021)
Filippo Bistaffa, Christian Blum, Jesús Cerquides, Alessandro Farinelli, Juan A. Rodríguez-Aguilar
A Computational Approach to Quantify the Benefits of Ridesharing for Policy Makers and Travellers. IEEE Trans. Intell. Transp. Syst. 22 (1) (2021)
Mehmet Anil Akbay, Christian Blum
Application of CMSA to the Minimum Positive Influence Dominating Set Problem. CCIA (2021)
Christian Blum, Tome Eftimov, Peter Korosec
Preface. Nat. Comput. 20 (3) (2021)
Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum
search algorithm for the constrained longest common subsequence problem. Inf. Process. Lett. 166 (2021)
Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felip Manyà, Günther R. Raidl
Solving longest common subsequence problems via a transformation to the maximum clique problem. Comput. Oper. Res. 125 (2021)
Gabriela Ochoa, Katherine M. Malan, Christian Blum
Search Trajectory Networks of Population-Based Algorithms in Continuous Spaces. EvoApplications (2020)
Dhananjay R. Thiruvady, Christian Blum, Andreas T. Ernst
Solution Merging in Matheuristics for Resource Constrained Job Scheduling. Algorithms 13 (10) (2020)
Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum
On Solving a Generalized Constrained Longest Common Subsequence Problem. OPTIMA (2020)
Teddy Nurcahyadi, Christian Blum
A New Approach for Making Use of Negative Learning in Ant Colony Optimization. ANTS Conference (2020)
Christian Blum
Minimum common string partition: on solving large-scale problem instances. Int. Trans. Oper. Res. 27 (1) (2020)
Matthias Horn, Marko Djukanovic, Christian Blum, Günther R. Raidl
On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. OPTIMA (2020)
Bohan Li, Xindi Zhang, Shaowei Cai, Jinkun Lin, Yiyuan Wang, Christian Blum
NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set. IJCAI (2020)
Marko Djukanovic, Günther R. Raidl, Christian Blum
Anytime algorithms for the longest common palindromic subsequence problem. Comput. Oper. Res. 114 (2020)
Marko Djukanovic, Günther R. Raidl, Christian Blum
Finding Longest Common Subsequences: New anytime A∗ search results. Appl. Soft Comput. 95 (2020)
Divansh Arora, Parikshit Maini, Pedro Pinacho Davidson, Christian Blum
Route planning for cooperative air-ground robots with fuel constraints: an approach based on CMSA. GECCO (2019)
Matthias Horn, Günther R. Raidl, Christian Blum
/Beam Search based anytime algorithm. Artif. Intell. 277 (2019)
Marko Djukanovic, Günther R. Raidl, Christian Blum
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. LOD (2019)
Pedro Pinacho Davidson, Salim Bouamama, Christian Blum
Application of CMSA to the minimum capacitated dominating set problem. GECCO (2019)
Marko Djukanovic, Günther R. Raidl, Christian Blum
A Heuristic Approach for Solving the Longest Common Square Subsequence Problem. EUROCAST (1) (2019)
Christian Blum, Haroldo Gambini Santos
Generic CP-Supported CMSA for Binary Integer Linear Programs. HM (2019)
Dhananjay R. Thiruvady, Christian Blum, Andreas T. Ernst
Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO. HM (2019)
Christian Blum, Dhananjay R. Thiruvady, Andreas T. Ernst, Matthias Horn, Günther R. Raidl
A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem. Australasian Conference on Artificial Intelligence (2019)
Guillem Rodríguez Corominas, Christian Blum, Maria J. Blesa
A biased random key genetic algorithm for the weighted independent domination problem. GECCO (Companion) (2019)
Salim Bouamama, Christian Blum, Jean-Guillaume Fages
An algorithm based on ant colony optimization for the minimum connected dominating set problem. Appl. Soft Comput. 80 (2019)
Ewa Andrejczuk, Filippo Bistaffa, Christian Blum, Juan A. Rodríguez-Aguilar, Carles Sierra
Synergistic team composition: A computational approach to foster diversity in teams. Knowl. Based Syst. 182 (2019)
Ewa Andrejczuk, Filippo Bistaffa, Christian Blum, Juan A. Rodríguez-Aguilar, Carles Sierra
Synergistic Team Composition: A Computational Approach to Foster Diversity in Teams. CoRR (2019)
Marco Dorigo, Mauro Birattari, Christian Blum, Anders Lyhne Christensen, Andreagiovanni Reina, Vito Trianni
ANTS 2018 special issue: Editorial. Swarm Intell. 13 (3-4) (2019)
Christian Blum, Maria J. Blesa
A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem. J. Heuristics 24 (3) (2018)
Aritz Pérez, Christian Blum, José Antonio Lozano
Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models. PGM (2018)
Filippo Bistaffa, Juan A. Rodríguez-Aguilar, Jesús Cerquides, Christian Blum
A Simulation Tool for Large-Scale Online Ridesharing. AAMAS (2018)
Pedro Pinacho Davidson, Christian Blum, José Antonio Lozano
The weighted independent domination problem: Integer linear programming models and metaheuristic approaches. Eur. J. Oper. Res. 265 (3) (2018)
Christian Blum, Maria J. Blesa
Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem. Appl. Soft Comput. 62 (2018)
Christian Blum
ILP-Based Reduced Variable Neighborhood Search for Large-Scale Minimum Common String Partition. Electron. Notes Discret. Math. 66 (2018)
Marko Djukanovic, Günther R. Raidl, Christian Blum
Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem. LION (2018)
Ewa Andrejczuk, Filippo Bistaffa, Christian Blum, Juan A. Rodríguez-Aguilar, Carles Sierra
Heterogeneous Teams for Homogeneous Performance. PRIMA (2018)
Christian Blum, Haroldo Gambini Santos
Generic CP-Supported CMSA for Binary Integer Linear Programs. CoRR (2018)
Ewa Andrejczuk, Filippo Bistaffa, Christian Blum, Juan A. Rodríguez-Aguilar, Carles Sierra
Solving the Synergistic Team Composition Problem. AAMAS (2018)
Christian Blum, Angel A. Juan, Helena R. Lourenço, Thomas Stützle
Special issue on "Metaheuristics". Int. Trans. Oper. Res. 24 (4) (2017)
Christian Blum, Maria J. Blesa
A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem. CoRR (2017)
Salim Bouamama, Christian Blum
On solving large-scale instances of the knapsack problem with setup by means of an iterated greedy algorithm. ICSC (2017)
Pedro Pinacho Davidson, Christian Blum, José Antonio Lozano
The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches. EvoCOP (2017)
Christian Blum, Maria J. Blesa
A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem. CEC (2017)
Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl
Large neighborhood search for the most strings with few bad columns problem. Soft Comput. 21 (17) (2017)
David Chalupa, Christian Blum
Mining k-reachable sets in real-world networks using domination in shortcut graphs. J. Comput. Sci. 22 (2017)
Matthias Horn, Günther R. Raidl, Christian Blum
Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment. MOD (2017)
Evelia Lizárraga, Maria J. Blesa, Christian Blum
Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? EvoCOP (2017)
Christian Blum, Angel A. Juan, Helena R. Lourenço, Thomas Stützle
Special issue on "Metaheuristics". Int. Trans. Oper. Res. 24 (6) (2017)
Christian Blum, Angel A. Juan, Helena Ramalhinho Dias Lourenço, Thomas Stützle
Special issue on "Metaheuristics". Int. Trans. Oper. Res. 24 (3) (2017)
Christian Blum, Christine Zarges
The Workshops at PPSN 2016. PPSN (2016)
Christian Blum
Construct, Merge, Solve and Adapt: Application to Unbalanced Minimum Common String Partition. HM (2016)
Christian Blum, Jordi Pereira
Extension of the CMSA Algorithm: An LP-based Way for Reducing Sub-instances. GECCO (2016)
Christian Blum, Maria J. Blesa
Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem. EvoCOP (2016)
Salim Bouamama, Christian Blum
A hybrid algorithmic model for the minimum weight dominating set problem. Simul. Model. Pract. Theory 64 (2016)
Christian Blum, Günther R. Raidl
Computational performance evaluation of two integer linear programming models for the minimum common string partition problem. Optim. Lett. 10 (1) (2016)
Christian Blum, Pedro Pinacho Davidson, Manuel López-Ibáñez, José Antonio Lozano
Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimization. Comput. Oper. Res. 68 (2016)
Francisco Chicano, Christian Blum, Gabriela Ochoa
Editorial for the Special Issue on Combinatorial Optimization Problems. Evol. Comput. 24 (4) (2016)
Carlos García-Martínez, Christian Blum, Francisco J. Rodríguez, Manuel Lozano
The firefighter problem: Empirical results on random graphs. Comput. Oper. Res. 60 (2015)
Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl
On solving the most strings with few bad columns problem: An ILP model and heuristics. INISTA (2015)
Christian Blum, Borja Calvo
A matheuristic for the minimum weight rooted arborescence problem. J. Heuristics 21 (4) (2015)
Christian Blum, Borja Calvo, Maria J. Blesa
FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs. Swarm Intell. 9 (2-3) (2015)
Christian Blum, José Antonio Lozano, Pedro Pinacho Davidson
An Artificial Bioindicator System for Network Intrusion Detection. Artif. Life 21 (2) (2015)
Christian Blum, Günther R. Raidl
Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem. CoRR (2015)
Christian Blum, José Antonio Lozano, Pedro Pinacho Davidson
Mathematical programming strategies for solving the minimum common string partition problem. Eur. J. Oper. Res. 242 (3) (2015)
Christian Blum, Maria J. Blesa, Carlos García-Martínez, Francisco J. Rodríguez, Manuel Lozano
The Firefighter Problem: Application of Hybrid Ant Colony Optimization Algorithms. EvoCOP (2014)
Christian Blum, José Antonio Lozano, Pedro Pinacho Davidson
Mathematical Programming Strategies for Solving the Minimum Common String Partition Problem. CoRR (2014)
Aritz Pérez, Christian Blum, José Antonio Lozano
Learning Maximum Weighted (k+1)-Order Decomposable Graphs by Integer Linear Programming. Probabilistic Graphical Models (2014)
Christian Blum, Maria J. Blesa, Borja Calvo
Can Frogs Find Large Independent Sets in a Decentralized Way? Yes They Can! ANTS Conference (2014)
Christian Blum, José Antonio Lozano, Pedro Pinacho Davidson
Iterative Probabilistic Tree Search for the Minimum Common String Partition Problem. Hybrid Metaheuristics (2014)

Christian Blum.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christian Blum