ChristianChristian BlumBlum

Scientific ResearcherScientific Researcher

Department:

Logic and ReasoningLogic and Reasoning

Position:

Scientific ResearcherScientific Researcher

 

 

Research areas:

  • Optimisation
  • Optimisation

Impact areas:

  • Optimisation
  • Optimisation

SDGs:

  • GOAL 11: Sustainable Cities and Communities
  • GOAL 11: Sustainable Cities and Communities

Website:

http://www.iiia.csic.es/~christian.blumhttp://www.iiia.csic.es/~christian.blum

E-mail:

christian.blum@iiia.csic.eschristian.blum@iiia.csic.es

Extension:

214214
2020
Li, Bohan,  Zhang, Xindi,  Cai, Shaowei,  Lin, Jinkun,  Wang, Yiyuan,  & Blum, Christian (2020). NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set. Proceedings of the Twenty-Nineth International Joint Conference on Artificial Intelligence, {IJCAI-20} . International Joint Conferences on Artificial Intelligence Organization. [BibTeX]
2019
Thiruvady, Dhananjay,  Blum, Christian,  & Ernst, Andreas T. (2019). Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO. International Workshop on Hybrid Metaheuristics (HM 2019) (pp. 16-30). Springer. [BibTeX]
Raidl, Günther R.,  Puchinger, Jakob,  & Blum, Christian (2019). Metaheuristic Hybrids. In Gendreau, Michel and Potvin, Jean-Yves (Eds.), Handbook of Metaheuristics (pp 385-417). Springer International Publishing. [BibTeX]
Arora, Divansh,  Maini, Parikshit,  Blum, Christian,  & Pinacho Davidson, Pedro (2019). Route Planning for Cooperative Air-Ground Robots with Fuel Constraints: An Approach based on CMSA. Genetic and Evolutionary Computation Conference (GECCO 2019) . [BibTeX]
Ewa Andrejczuk,  Filippo Bistaffa,  Blum, Christian,  Juan A. Rodríguez-Aguilar,  & Carles Sierra (2019). Synergistic team composition: A computational approach to foster diversity in teams. Knowledge-Based Systems. [BibTeX]
2018
Blum, Christian,  & Blesa, Maria J (2018). A Comprehensive Comparison of Metaheuristics for the Repetition-Free Longest Common Subsequence Problem. Journal of Heuristics. [BibTeX]
Pérez, Aritz,  Blum, Christian,  & Lozano, José Antonio (2018). Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models . [BibTeX]
Filippo Bistaffa,  Juan A. Rodríguez-Aguilar,  Jesús Cerquides,  & Blum, Christian (2018). A Simulation Tool for Large-Scale Online Ridesharing (Demonstration). International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018) . [BibTeX]
Ewa Andrejczuk,  Filippo Bistaffa,  Blum, Christian,  Juan A. Rodríguez-Aguilar,  & Carles Sierra (2018). Heterogeneous Teams for Homogeneous Performance. Proceedings of the 21st International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2018) . [BibTeX]
Blum, Christian,  & Blesa, Maria J (2018). Hybrid Techniques Based on Solving Reduced Problem Instances for a Longest Common Subsequence Problem. Applied Soft Computing. [BibTeX]
Blum, Christian (2018). ILP-Based Reduced Variable Neighborhood Search for Large-Scale Minimum Common String Partition. Electronic Notes in Discrete Mathematics. [BibTeX]
Blum, Christian,  & Festa, Paola (2018). Selected String Problems. Handbook of Heuristics. [BibTeX]
Ewa Andrejczuk,  Filippo Bistaffa,  Blum, Christian,  Juan A. Rodríguez-Aguilar,  & Carles Sierra (2018). Solving the Synergistic Team Formation Problem. Proceedings of the 17th Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2018) . [BibTeX]
Pinacho Davidson, Pedro,  Blum, Christian,  & Lozano, José Antonio (2018). The Weighted Independent Domination Problem: Integer Linear Programming Models and Metaheuristic Approaches. European Journal of Operational Research. [BibTeX]
2017
Blum, Christian,  & Blesa, Maria J (2017). A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem . [BibTeX]
Blum, Christian,  Blesa, Maria J,  Duarte, Abraham,  & Sánchez-Oro, Jesús (2017). An Alternative ILP Model and Algorithmic Ideas for the Maximum Edge-Disjoint Paths Problem. Metaheuristics International Conference (MIC) . [BibTeX]
Lizárraga, Evelia,  Blesa, Maria J,  & Blum, Christian (2017). Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? . [BibTeX]
Horn, Matthias,  Raidl, Günther R,  & Blum, Christian (2017). Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment . [BibTeX]
Lizárraga, Evelia,  Blesa, Maria J,  Blum, Christian,  & Raidl, Günther R (2017). Large neighborhood search for the most strings with few bad columns problem. Soft Computing. [BibTeX]
Chalupa, David,  & Blum, Christian (2017). Mining k-Reachable Sets in Real-world Networks Using Domination in Shortcut Graphs. Journal of Computational Science. [BibTeX]
 IP