32 citations · 56 across the 11 of their papers we have counts for
12 papers
An Efficient Merge Search Matheuristic for Maximising the Net Present Value of Project Schedules
Dhananjay R. Thiruvady, Su Nguyen, Christian Blum +1
Resource constrained project scheduling is an important combinatorial optimisation problem with many practical applications. With complex requirements such as precedence constraint…
Synergistic Team Composition: A Computational Approach to Foster Diversity in Teams
Ewa Andrejczuk, Filippo Bistaffa, Christian Blum +2
Co-operative learning in heterogeneous teams refers to learning methods in which teams are organised both to accomplish academic tasks and for individuals to gain knowledge. Compet…
Generic CP-Supported CMSA for Binary Integer Linear Programs
Christian Blum, Haroldo Gambini Santos
Construct, Merge, Solve and Adapt (CMSA) is a general hybrid metaheuristic for solving combinatorial optimization problems. At each iteration, CMSA (1) constructs feasible solution…
A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem
Christian Blum, Maria J. Blesa
The longest arc-preserving common subsequence problem is an NP-hard combinatorial optimization problem from the field of computational biology. This problem finds applications, in…
Active exploration of sensor networks from a robotics perspective
Christian Blum, Verena V. Hafner
Traditional algorithms for robots who need to integrate into a wireless network often focus on one specific task. In this work we want to develop simple, adaptive and reusable algo…
Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem
Christian Blum, Günther R. Raidl
In the minimum common string partition (MCSP) problem two related input strings are given. "Related" refers to the property that both strings consist of the same set of letters app…