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
2022
Albert L\'{o}pez Serrano,
& Christian Blum
(2022).
A Biased Random Key Genetic Algorithm Applied to Target Set Selection in Viral Marketing.
Proceedings of the Genetic and Evolutionary Computation Conference
(pp. 241–250).
Association for Computing Machinery.
https://doi.org/10.1145/3512290.3528785.
[BibTeX]
Salim Bouamama,
Christian Blum,
& Pedro Pinacho-Davidson
(2022).
A Population-Based Iterated Greedy Algorithm for Maximizing Sensor Network Lifetime.
Sensors, 22.
https://doi.org/10.3390/s22051804.
[BibTeX]
[PDF]
Marko Djukanovic,
Dragan Matic,
Christian Blum,
& Aleksandar Kartelj
(2022).
Application of A{\$}{\$}^*{\$}{\$}to the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings.
Moun{\\^i}m El Yacoubi, Eric Granger, Pong Chi Yuen, Umapada Pal, & Nicole Vincent (Eds.),
Pattern Recognition and Artificial Intelligence
(pp. 53--64).
Springer International Publishing.
[BibTeX]
Mehmet An{\i}l Akbay,
Albert López Serrano,
& Christian Blum
(2022).
A Self-Adaptive Variant of CMSA: Application to the Minimum Positive Influence Dominating Set Problem.
International Journal of Computational Intelligence Systems, 15, 44.
https://doi.org/10.1007/s44196-022-00098-1.
[BibTeX]
[PDF]
Marko Djukanović,
Aleksandar Kartelj,
Dragan Matić,
Milana Grbić,
Christian Blum,
& Günther R. Raidl
(2022).
Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences.
Applied Soft Computing, 122, 108844.
https://doi.org/10.1016/j.asoc.2022.108844.
[BibTeX]
[PDF]
Guillem Rodríguez Corominas,
Christian Blum,
& Maria J. Blesa
(2022).
Negative Learning Ant Colony Optimization for Network Alignment.
Proceedings of the Genetic and Evolutionary Computation Conference
(pp. 278–286).
Association for Computing Machinery.
https://doi.org/10.1145/3512290.3528795.
[BibTeX]
Christian Blum,
Tome Eftimov,
& Peter Koro{\v{s}}ec
(2022).
Preface.
Natural Computing, 21, 127-130.
https://doi.org/10.1007/s11047-021-09859-x.
[BibTeX]
[PDF]
Mehmet Anıl Akbay,
Can Berk Kalayci,
Christian Blum,
& Olcay Polat
(2022).
Variable Neighborhood Search for the Two-Echelon Electric Vehicle Routing Problem with Time Windows.
Applied Sciences, 12.
https://doi.org/10.3390/app12031014.
[BibTeX]
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]
Marco Dorigo,
Thomas Stützle,
Maria J. Blesa,
Christian Blum,
Heiko Hamann,
& Mary Katherine Heinrich
(2021).
ANTS 2020 Special Issue: Editorial.
Swarm Intelligence, 15, 311-313.
https://doi.org/10.1007/s11721-021-00208-3.
[BibTeX]
[PDF]
Mehmet Anil Akbay,
& Christian Blum
(2021).
Application of CMSA to the Minimum Positive Influence Dominating Set Problem.
[BibTeX]
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]
Christian Blum
(2021).
On the Use of Learning in Hybrid Algorithms Combining Metaheuristics with Exact Techniques.
.
[BibTeX]
Prev
1 (current)
2
3
Next