People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Christian Blum
Recent Publications
An A* Search Algorithm for the Constrained Longest Common Subsequence Problem
2020
Finding Longest Common Subsequences: New anytime A$^*$ Search Results
2020
On Solving a Generalized Constrained Longest Common Subsequence Problem
2020
Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem
2020
Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem
2019
Finding Longest Common Subsequences: New A* Anytime Results
2019
Job Sequencing with One Common and Multiple Secondary Resources: An A*/Beam Search Based Anytime Algorithm
2019
Metaheuristic Hybrids
2019
Anytime Algorithms for the Longest Common Palindromic Subsequence Problem
2018
Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment
2017
Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem
2016
Hybrid Metaheuristics -- Powerful Tools for Optimization
2016
On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics
2015
Hybrid Metaheuristics in Combinatorial Optimization: A Survey
2011
A Brief Survey on Hybrid Metaheuristics
2010
Hybrid Metaheuristics
2009
Cite
×