Li, Bohan, Zhang, Xindi, Cai, Shaowei, Lin, Jinkun, Wang, Yiyuan, Blum, Christian; NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set. 2020. [BibTeX]
2019
Thiruvady, Dhananjay, Blum, Christian, Ernst, Andreas T.; Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO. 2019. [BibTeX]
Arora, Divansh, Maini, Parikshit, Blum, Christian, Pinacho Davidson, Pedro; Route Planning for Cooperative Air-Ground Robots with Fuel Constraints: An Approach based on CMSA. 2019. [BibTeX]
Blum, Christian, Blesa, Maria J; A Comprehensive Comparison of Metaheuristics for the Repetition-Free Longest Common Subsequence Problem. Journal of Heuristics; 2018. [BibTeX]
Pérez, Aritz, Blum, Christian, Lozano, José Antonio; Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models. The 9th International Conference on Probabilistic Graphical Models; 2018. [BibTeX]
Blum, Christian, Blesa, Maria J; Hybrid Techniques Based on Solving Reduced Problem Instances for a Longest Common Subsequence Problem. Applied Soft Computing; 2018. [BibTeX]
Blum, Christian; ILP-Based Reduced Variable Neighborhood Search for Large-Scale Minimum Common String Partition. Electronic Notes in Discrete Mathematics; 2018. [BibTeX]
Pinacho Davidson, Pedro, Blum, Christian, Lozano, José Antonio; The Weighted Independent Domination Problem: Integer Linear Programming Models and Metaheuristic Approaches. European Journal of Operational Research; 2018. [BibTeX]
2017
Blum, Christian, Blesa, Maria J; A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem. CEC 2017 -- Congress on Evolutionary Computation; 2017. [BibTeX]
Blum, Christian, Blesa, Maria J, Duarte, Abraham, Sánchez-Oro, Jesús; An Alternative ILP Model and Algorithmic Ideas for the Maximum Edge-Disjoint Paths Problem. 2017. [BibTeX]
Lizárraga, Evelia, Blesa, Maria J, Blum, Christian; Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?. EvoCOP 2017 -- 17th European Conference on Evolutionary Computation in Combinatorial Optimization; 2017. [BibTeX]
Horn, Matthias, Raidl, Günther R, Blum, Christian; Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment. MOD 2017 -- The Third International Conference on Machine Learning, Optimization and Big Data; 2017. [BibTeX]
Lizárraga, Evelia, Blesa, Maria J, Blum, Christian, Raidl, Günther R; Large neighborhood search for the most strings with few bad columns problem. Soft Computing; 2017. [BibTeX]
