Accepted Abstracts

Extended Abstracts

Solving the Sequential Ordering Problem with anytime tree search
Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard and Vincent Jost

On the Use of Decision Diagrams for the Repetition-Free Longest Common Subsequence
Matthias Horn, Marko Djukanovic, Christian Blum and Günther R. Raidl

A Beam Search Approach to the Traveling Tournament Problem
Nikolaus Frohner, Bernhard Neumann and Günther Raidl

Justifying All Differences Using Pseudo-Boolean Reasoning
Jan Elffers, Stephan Gocht, Ciaran McCreesh and Jakob Nordstrom