Christian
Christian
 
Blum
Blum

Scientific Researcher
Scientific Researcher


Department:

Logic and Reasoning
Logic and Reasoning

Position:

Scientific Researcher
Scientific Researcher



Research areas:

  • Combinatorial Optimisation
  • Optimisation
  • Multiagent Systems
  • Combinatorial Optimisation
  • Optimisation
  • Multiagent Systems

Impact areas:

  • Optimisation
  • Smart Cities
  • Transport / Automotive
  • Optimisation
  • Smart Cities
  • Transport / Automotive

SDGs:

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

Phone Extension:

214
214

E-mail:

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

Website:

2021
Christian Blum,  & Gabriela Ochoa (2021). A comparative analysis of two matheuristics by means of merged local optima networks. European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2020.08.008. [BibTeX]
Christian Blum,  Marko Djukanovic,  Alberto Santini,  Hua Jiang,  Chu-Min Li,  Felip Manyà,  & Günter R. Raidl (2021). Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem. Computers & Operations Research, article number 105089. https://doi.org/10.1016/j.cor.2020.105089. [BibTeX]
2020
Christian Blum,  Marta Verdaguer,  Hèctor Monclús,  & Manel Poch (2020). A new optimization model for wastewater treatment planning with a temporal component. Process Safety and Environmental Protection, 136, 157 - 168. [BibTeX]
Marko Djukanovic,  Günther R. Raidl,  & Christian Blum (2020). Anytime algorithms for the longest common palindromic subsequence problem. Computers & Operations Research, 114, article number 104827. https://doi.org/10.1016/j.cor.2019.104827. [BibTeX]
Marko Djukanovic,  Günther R. Raidl,  & Christian Blum (2020). Finding Longest Common Subsequences: New anytime A* search results. Applied Soft Computing, 95, 106499. https://doi.org/10.1016/j.asoc.2020.106499. [BibTeX]
Christian Blum (2020). Minimum common string partition: on solving large-scale problem instances. International Transactions in Operational Research, 27, 91--111. https://doi.org/10.1111/itor.12603. [BibTeX]
Bohan Li,  Xindi Zhang,  Shaowei Cai,  Jinkun Lin,  Yiyuan Wang,  & Christian Blum (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
Filippo Bistaffa,  Christian Blum,  Jesús Cerquides,  Alessandro Farinelli,  & Juan A. Rodríguez-Aguilar (2019). A Computational Approach to Quantify the Benefits of Ridesharing for Policy Makers and Travellers. IEEE Transactions on Intelligent Transportation Systems. [BibTeX]  [PDF]
Dhananjay Thiruvady,  Christian Blum,  & Andreas T. Ernst (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. https://doi.org/10.1007/978-3-030-05983-5_2. [BibTeX]
Günther R. Raidl,  Jakob Puchinger,  & Christian Blum (2019). Metaheuristic Hybrids. Michel Gendreau, & Jean-Yves Potvin (Eds.), Handbook of Metaheuristics (pp 385-417). Springer International Publishing. https://doi.org/10.1007/978-3-319-91086-4_12. [BibTeX]
Divansh Arora,  Parikshit Maini,  Christian Blum,  & Pedro Pinacho Davidson (2019). Route Planning for Cooperative Air-Ground Robots with Fuel Constraints: An Approach based on CMSA. Genetic and Evolutionary Computation Conference (GECCO 2019) (pp. 207-214). ACM Press. https://doi.org/10.1145/3321707.3321820. [BibTeX]
Ewa Andrejczuk,  Filippo Bistaffa,  Christian Blum,  Juan A. Rodríguez-Aguilar,  & Carles Sierra (2019). Synergistic team composition: A computational approach to foster diversity in teams. Knowledge-Based Systems, 182. https://doi.org/10.1016/j.knosys.2019.06.007. [BibTeX]
2018
Christian Blum,  & Maria J Blesa (2018). A Comprehensive Comparison of Metaheuristics for the Repetition-Free Longest Common Subsequence Problem. Journal of Heuristics, 24, 551-579. https://doi.org/http://dx.doi.org/10.1007/s10732-017-9329-x. [BibTeX]
Aritz Pérez,  Christian Blum,  & José Antonio Lozano (2018). Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models (pp. 320-331). Proceedings of Machine Learning Research. https://doi.org/http://proceedings.mlr.press/v72/perez18a/perez18a.pdf. [BibTeX]
Filippo Bistaffa,  Juan A. Rodríguez-Aguilar,  Jesús Cerquides,  & Christian Blum (2018). A Simulation Tool for Large-Scale Online Ridesharing (Demonstration). International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018) (pp. 1797-1799). IFAAMAS. https://doi.org/https://dl.acm.org/citation.cfm?id=3237981. [BibTeX]
Ewa Andrejczuk,  Filippo Bistaffa,  Christian Blum,  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) (pp. 89-105). Springer LNCS. https://doi.org/10.1007/978-3-030-03098-8_6. [BibTeX]
Christian Blum,  & Maria J Blesa (2018). Hybrid Techniques Based on Solving Reduced Problem Instances for a Longest Common Subsequence Problem. Applied Soft Computing, 62, 15-28. https://doi.org/10.1016/j.asoc.2017.10.005. [BibTeX]
Christian Blum (2018). ILP-Based Reduced Variable Neighborhood Search for Large-Scale Minimum Common String Partition. Electronic Notes in Discrete Mathematics, 66, 15-22. https://doi.org/10.1016/j.endm.2018.03.003. [BibTeX]
Christian Blum,  & Paola Festa (2018). Selected String Problems. Rafael Martí, Panos Pardalos, & Mauricio G.C. Resende (Eds.), Handbook of Heuristics (pp 1221-1240). Springer International Publishing. https://doi.org/10.1007/978-3-319-07153-4_58-1. [BibTeX]
Ewa Andrejczuk,  Filippo Bistaffa,  Christian Blum,  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) (pp. 1853-1855). IFAAMAS. [BibTeX]