Publicaciones (60) Publicaciones de CHRISTIAN BLUM

2018

  1. Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models

    Proceedings of Machine Learning Research

  2. The weighted independent domination problem: Integer linear programming models and metaheuristic approaches

    European Journal of Operational Research, Vol. 265, Núm. 3, pp. 860-871

2017

  1. A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem

    2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC)

  2. A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem

    2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings

  3. Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: Which one works better when?

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  4. Large neighborhood search for the most strings with few bad columns problem

    Soft Computing, Vol. 21, Núm. 17, pp. 4901-4915

  5. Mining k-reachable sets in real-world networks using domination in shortcut graphs

    Journal of Computational Science, Vol. 22, pp. 1-14

  6. On Solving Large-Scale Instances of the Knapsack Problem with Setup by means of an Iterated Greedy Algorithm

    2017 6TH INTERNATIONAL CONFERENCE ON SYSTEMS AND CONTROL (ICSC' 17)

  7. On solving large-scale instances of the knapsack problem with setup by means of an iterated greedy algorithm

    2017 6th International Conference on Systems and Control, ICSC 2017

  8. 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

  1. A hybrid algorithmic model for the minimum weight dominating set problem

    Simulation Modelling Practice and Theory, Vol. 64, pp. 57-68

  2. Ant colony optimization

    Intelligent Systems (CRC Press)

  3. Computational performance evaluation of two integer linear programming models for the minimum common string partition problem

    Optimization Letters, Vol. 10, Núm. 1, pp. 189-205

  4. Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimization

    Computers and Operations Research, Vol. 68, pp. 75-88

  5. Construct, merge, solve and adapt: Application to the repetition-free longest common subsequence problem

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  6. 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)

  7. Editorial for the special issue on combinatorial optimization problems

    Evolutionary Computation

  8. Extension of the CMSA algorithm: An LP-based way for reducing sub-instances

    GECCO 2016 - Proceedings of the 2016 Genetic and Evolutionary Computation Conference

  9. Further Hybrids and Conclusions

    HYBRID METAHEURISTICS: POWERFUL TOOLS FOR OPTIMIZATION

  10. Hybrid Metaheuristics Powerful Tools for Optimization Introduction

    HYBRID METAHEURISTICS: POWERFUL TOOLS FOR OPTIMIZATION