Christian
Blum
Scientific Researcher
Logic and Reasoning
Research areas:
- Combinatorial Optimisation
- Multiagent Systems
- Learning
- Swarn Computing
- Bioinformatics
- Optimisation
Impact areas:
- Smart Cities
- Transport / Automotive
- Industry
SDGs:
- GOAL 11: Sustainable Cities and Communities
- GOAL 09: Industry, Innovation & Infrastructure
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]
Filippo Bistaffa,
Christian Blum,
Jesús Cerquides,
Alessandro Farinelli,
& Juan A. Rodríguez-Aguilar
(2021).
A Computational Approach to Quantify the Benefits of Ridesharing for Policy Makers and Travellers.
IEEE Transactions on Intelligent Transportation Systems, 22, 119-130.
https://doi.org/10.1109/TITS.2019.2954982.
[BibTeX]
[PDF]
Teddy Nurcahyadi,
& Christian Blum
(2021).
Adding Negative Learning to Ant Colony Optimization:A Comprehensive Study.
Mathematics, 9.
https://doi.org/10.3390/math9040361.
[BibTeX]
[PDF]
Samir Balbal,
Salim Bouamama,
& Christian Blum
(2021).
A Greedy Heuristic for Maximizing the Lifetime of Wireless Sensor Networks Based on Disjoint Weighted Dominating Sets.
Algorithms, 14.
https://doi.org/10.3390/a14060170.
[BibTeX]
[PDF]
Marko Djukanovic,
Christoph Berger,
Günther R. Raidl,
& Christian Blum
(2021).
An A⁎ search algorithm for the constrained longest common subsequence problem.
Information Processing Letters, 166, 106041.
https://doi.org/10.1016/j.ipl.2020.106041.
[BibTeX]
[PDF]
Salim Bouamama,
& Christian Blum
(2021).
An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks.
Algorithms, 14.
https://doi.org/10.3390/a14030079.
[BibTeX]
[PDF]
Albert López Serrano,
Teddy Nurcahyadi,
Salim Bouamama,
& Christian Blum
(2021).
Negative Learning Ant Colony Optimization for the Minimum Positive Influence Dominating Set Problem.
Proceedings of the Genetic and Evolutionary Computation Conference Companion
(pp. 1974–1977).
Association for Computing Machinery.
https://doi.org/10.1145/3449726.3463130.
[BibTeX]
Teddy Nurcahyadi,
& Christian Blum
(2021).
Negative Learning in Ant Colony Optimization: Application to the Multi Dimensional Knapsack Problem.
2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence
(pp. 22–27).
Association for Computing Machinery.
https://doi.org/10.1145/3461598.3461602.
[BibTeX]
Jon Perez,
Jose Luis Flores,
Christian Blum,
Jesus Cerquides,
& Alex Abuin
(2021).
Optimization Techniques and Formal Verification for the Software Design of Boolean Algebra Based Safety-Critical Systems.
IEEE Transactions on Industrial Informatics, 1-1.
https://doi.org/10.1109/TII.2021.3074394.
[BibTeX]
Gabriela Ochoa,
Katherine M. Malan,
& Christian Blum
(2021).
Search trajectory networks: A tool for analysing and visualising the behaviour of metaheuristics.
Applied Soft Computing, 109, 107492.
https://doi.org/10.1016/j.asoc.2021.107492.
[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
Teddy Nurcahyadi,
& Christian Blum
(2020).
A New Approach for Making Use of Negative Learning in Ant Colony Optimization.
Marco Dorigo, Thomas Stützle, Maria J. Blesa, Christian Blum, Heiko Hamann, Mary Katherine Heinrich, & Volker Strobel (Eds.),
Swarm Intelligence
(pp. 16--28).
Springer International Publishing.
[BibTeX]
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]
Pedro Pinacho-Davidson,
& Christian Blum
(2020).
BARRAKUDA: A Hybrid Evolutionary Algorithm for Minimum Capacitated Dominating Set Problem.
Mathematics, 8.
https://doi.org/10.3390/math8111858.
[BibTeX]
[PDF]
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]
[PDF]
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]
Marko Djukanovic,
Christoph Berger,
Günther R. Raidl,
& Christian Blum
(2020).
On Solving a Generalized Constrained Longest Common Subsequence Problem.
Nicholas Olenev, Yuri Evtushenko, Michael Khachay, & Vlasta Malkova (Eds.),
Optimization and Applications
(pp. 55--70).
Springer International Publishing.
[BibTeX]
[PDF]
Matthias Horn,
Marko Djukanovic,
Christian Blum,
& Günther R. Raidl
(2020).
On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences.
Nicholas Olenev, Yuri Evtushenko, Michael Khachay, & Vlasta Malkova (Eds.),
Optimization and Applications
(pp. 134--149).
Springer International Publishing.
[BibTeX]
[PDF]
Prev
1 (current)
2
3
Next