CHRISTIAN
BLUM
Researcher in the period 20132016
Publications (60) CHRISTIAN BLUM publications
2018

Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models
Proceedings of Machine Learning Research

The weighted independent domination problem: Integer linear programming models and metaheuristic approaches
European Journal of Operational Research, Vol. 265, Núm. 3, pp. 860871
2017

A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest ArcPreserving Common Subsequence Problem
2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC)

A hybrid evolutionary algorithm based on solution merging for the longest arcpreserving common subsequence problem
2017 IEEE Congress on Evolutionary Computation, CEC 2017  Proceedings

Construct, merge, solve and adapt versus large neighborhood search for solving the multidimensional knapsack problem: Which one works better when?
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Large neighborhood search for the most strings with few bad columns problem
Soft Computing, Vol. 21, Núm. 17, pp. 49014915

Mining kreachable sets in realworld networks using domination in shortcut graphs
Journal of Computational Science, Vol. 22, pp. 114

On Solving LargeScale Instances of the Knapsack Problem with Setup by means of an Iterated Greedy Algorithm
2017 6TH INTERNATIONAL CONFERENCE ON SYSTEMS AND CONTROL (ICSC' 17)

On solving largescale instances of the knapsack problem with setup by means of an iterated greedy algorithm
2017 6th International Conference on Systems and Control, ICSC 2017

The weighted independent domination problem: ILP model and algorithmic approaches
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2016

A hybrid algorithmic model for the minimum weight dominating set problem
Simulation Modelling Practice and Theory, Vol. 64, pp. 5768

Ant colony optimization
Intelligent Systems (CRC Press)

Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
Optimization Letters, Vol. 10, Núm. 1, pp. 189205

Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimization
Computers and Operations Research, Vol. 68, pp. 7588

Construct, merge, solve and adapt: Application to the repetitionfree longest common subsequence problem
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Construct, merge, solve and adapt: Application to unbalanced minimum common string partition
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Editorial for the special issue on combinatorial optimization problems
Evolutionary Computation

Extension of the CMSA algorithm: An LPbased way for reducing subinstances
GECCO 2016  Proceedings of the 2016 Genetic and Evolutionary Computation Conference

Further Hybrids and Conclusions
HYBRID METAHEURISTICS: POWERFUL TOOLS FOR OPTIMIZATION

Hybrid Metaheuristics Powerful Tools for Optimization Introduction
HYBRID METAHEURISTICS: POWERFUL TOOLS FOR OPTIMIZATION