In this paper, we present a dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (...
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo ...
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
Arc consistency plays a central role in solving Constraint Satisfaction Problems. This is the reason why many algorithms have been proposed to establish it. Recently, an algorithm ...
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...