Blum, Christian

Recent Publications

Learning to Select Promising Initial Solutions for Large Neighborhood Search-Based Multi-Agent Path Finding

Huber, Marc, Günther Raidl, Blum, Christian

Computer Aided Systems Theory – EUROCAST 2024 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 236-250, 2025, Springer.

A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem

Reixach, Jaume, Blum, Christian, Djukanović, Marko, Günther Raidl

IEEE Transactions on Evolutionary Computation, 2024.
Note: early access

A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem

Reixach, Jaume, Blum, Christian, Djukanović, Marko, Günther Raidl

Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2024 (T. Stützle and M. Wagner), volume 14632 of LNCS, pages 1-15, 2024, Springer.
Note: best paper award winner

Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequences

Djukanovic, Marko, Kartelj, Aleksandar, Matić, Dragan, Grbić, Milana, Blum, Christian, Günther Raidl

Applied Soft Computing, volume 122, pages 108844, 2022.

Solving the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings

Djukanovic, Marko, Kartelj Aleksandar, Matic, Dragan,, Grbic, Milana, Blum, Christian, Günther Raidl

2021, Technical report AC-TR-21-008, Algorithms and Complexity Group, TU Wien.

Solving the Longest Common Subsequence Problem Concerning Non-uniform Distributions of Letters in Input Strings

Nikolic, Bojan, Kartelj Aleksandar, Djukanovic, Marko, Grbic, Milana, Blum, Christian, Günther Raidl

2021, Technical report AC-TR-21-009, Algorithms and Complexity Group, TU Wien.

Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings

Nikolic, Bojan, Kartelj, Aleksandar, Djukanovic, Marko, Grbić, Milana, Blum, Christian, Günther Raidl

Mathematics, volume 9, number 13, 2021.

A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation

Djukanovic, Marko, Günther Raidl, Blum, Christian

Proceedings of LOD 2019 – The 5th International Conference on Machine Learning, Optimization and Data Science (Nicosia, Giuseppe and Pardalos, Panos and Giuffrida, Giovanni and Umeton, Renato and Sciacca, Vincenzo), volume 11943 of LNCS, pages 154-167, 2020, Springer.

On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences

Horn, Matthias, Djukanovic, Marko, Blum, Christian, Günther Raidl

Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Olenev, Nicholas and Evtushenko, Yuri and Khachay, Michael and Malkova, Vlasta), volume 12422 of LNCS, pages 134-149, 2020, Springer.

A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem

Blum, Christian, Thiruvady, Dhananjay, Ernst, Andreas T., Horn, Matthias, Günther Raidl

Proceedings of AI 2019: Advances in Artificial Intelligence (Liu, Jixue and Bailey, James), volume 11919 of LNCS, pages 549-560, 2019, Springer.

A Heuristic Approach for Solving the Longest Common Square Subsequence Problem

Djukanovic, Marko, Günther Raidl, Blum, Christian

Proceedings of EUROCAST 2019 – 17th International Conference on Computer Aided Systems Theory (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 12013 of LNCS, pages 429-437, 2019, Springer.