32 citations · 56 across the 11 of their papers we have counts for
7 papers · 1 filter
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…
Mathematical Programming Strategies for Solving the Minimum Common String Partition Problem
Christian Blum, José A. Lozano, Pedro Pinacho Davidson
The minimum common string partition problem is an NP-hard combinatorial optimization problem with applications in computational biology. In this work we propose the first integer l…
On Solving the Oriented Two-Dimensional Bin Packing Problem under Free Guillotine Cutting: Exploiting the Power of Probabilistic Solution Construction
Christian Blum, Verena Schmid, Lukas Baumgartner
Two-dimensional bin packing problems are highly relevant combinatorial optimization problems. They find a large number of applications, for example, in the context of transportatio…
Distributed Graph Coloring: An Approach Based on the Calling Behavior of Japanese Tree Frogs
Hugo Hernández, Christian Blum
Graph coloring, also known as vertex coloring, considers the problem of assigning colors to the nodes of a graph such that adjacent nodes do not share the same color. The optimizat…