Christian Blum

Recent Publications

An A* Search Algorithm for the Constrained Longest Common Subsequence Problem
Marko Djukanovic, Christoph Berger, Günther Raidl, Christian Blum
Information Processing Letters, volume 166, number 106041, 2020.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf
PDF Cite DOI
An A* Search Algorithm for the Constrained Longest Common Subsequence Problem
Marko Djukanovic, Christoph Berger, Günther Raidl, Christian Blum
2020, Technical report AC-TR-20-004, Algorithms and Complexity Group, TU Wien.
PDF Cite
Anytime Algorithms for the Longest Common Palindromic Subsequence Problem
Marko Djukanovic, Günther Raidl, Christian Blum
Computers & Operations Research, volume 114, pages 104827, 2020, Elsevier.
Cite DOI
Finding Longest Common Subsequences: New anytime A$^*$ Search Results
Marko Djukanovic, Günther Raidl, Christian Blum
Applied Soft Computing, volume 95, number 106400, 2020.
PDF Cite
On Solving a Generalized Constrained Longest Common Subsequence Problem
Marko Djukanovic, Christoph Berger, Günther Raidl, Christian Blum
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 55-79, 2020, Springer.
PDF Cite DOI
Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem
Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felipe Manya, Günther Raidl
2020, Technical report AC-TR-20-003, Algorithms and Complexity Group, TU Wien.
PDF Cite
Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem
Christian Blum, Marko Djukanovic, Alberto Santini and Hua Jiang, Chu-Min Li, Felipe Manya, Günther Raidl
Computers & Operations Research, volume 125, number 105089, 2020.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf
PDF Cite DOI
A Heuristic Approach for Solving the Longest Common Square Subsequence Problem
Marko Djukanovic, Günther Raidl, Christian Blum
Extended Abstracts of the Seventeenth International Conference on Computer Aided Systems Theory (EUROCAST 2019), 2019.
Note: accepted for presentation
PDF Cite
Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem
Marko Djukanovic, Günther Raidl, Christian Blum
Proceedings of LION~12 – the 12th International Conference on Learning and Intelligent Optimization, volume 11353 of LNCS, pages 199-214, 2019, Springer.
Cite DOI
Finding Longest Common Subsequences: New A* Anytime Results
Marko Djukanovic, Günther Raidl, Christian Blum
2019, Technical report AC-TR-19-008, Algorithms and Complexity Group, TU Wien.
PDF Cite
Job Sequencing with One Common and Multiple Secondary Resources: An A*/Beam Search Based Anytime Algorithm
Matthias Horn, Günther Raidl, Christian Blum
Artificial Intelligence, volume 277, number 103173, 2019.
Cite DOI
Metaheuristic Hybrids
Günther Raidl, Jakob Puchinger, Christian Blum
Chapter in Handbook of Metaheuristics (Michel Gendreau and Jean Yves Potvin), pages 385-417, 2019, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-19.pdf
Cite
Anytime Algorithms for the Longest Common Palindromic Subsequence Problem
Marko Djukanovic, Günther Raidl, Christian Blum
2018, Technical report AC-TR-18-012, Algorithms and Complexity Group, TU Wien.
PDF Cite
Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment
Matthias Horn, Günther Raidl, Christian Blum
MOD~2017: Machine Learning, Optimization, and Big Data – Third International Conference (Giuffrida, Giovanni and Nicosia, Giuseppe and Pardalos, Panos and Umeton, Renato), volume 10710 of LNCS, pages 506-518, 2017, Springer.
PDF Cite
Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem
Christian Blum, Günther Raidl
Optimization Letters, volume 10, number 1, pages 189-205, 2016.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/blum-15.pdf
Cite
Hybrid Metaheuristics -- Powerful Tools for Optimization
Christian Blum, Günther Raidl
2016, Springer.
PDF Cite Project
On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics
Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther Raidl
Proceedings of the 2015 International Symposium on Innovations in Intelligent Systems and Applications (INISTA) (David Camacho and others), pages 1-8, 2015, IEEE Xplore.
PDF Cite
Hybrid Metaheuristics in Combinatorial Optimization: A Survey
Christian Blum, Jakob Puchinger, Günther Raidl, Andrea Roli
Applied Soft Computing, volume 11, pages 4135-4151, 2011.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/blum-11.pdf
Cite
A Brief Survey on Hybrid Metaheuristics
Christian Blum, Jakob Puchinger, Günther Raidl
Proceedings of BIOMA 2010 – 4th International Conference on Bioinspired Optimization Methods and their Applications (B. Filipic and J. Silc), pages 3-16, 2010.
PDF Cite
Metaheuristic Hybrids
Günther Raidl, Jakob Puchinger, Christian Blum
Chapter in Handbook of Metaheuristics (Michel Gendreau and Jean Yves Potvin), volume 146 of International Series in Operations Research & Management Science, pages 469-496, 2010, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-08a.pdf
Cite
Hybrid Metaheuristics
Christian Blum, Jakob Puchinger, Günther Raidl, Andrea Roli
Chapter in CPAIOR 10th Anniversary (M. Milano and P. Van Hentenryck), 2009, Springer.
Note: to appear
Cite