research
∙
11/19/2019
Steepest ascent can be exponential in bounded treewidth problems
We investigate the complexity of local search based on steepest ascent. ...
share
research
∙
07/02/2019
Representing fitness landscapes by valued constraints to understand the complexity of local search
Local search is widely used to solve combinatorial optimisation problems...
research
∙
04/20/2017
On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns
Singleton arc consistency is an important type of local consistency whic...
research
∙
02/12/2015
Variable and value elimination in binary constraint satisfaction via forbidden patterns
Variable or value elimination in a constraint satisfaction problem (CSP)...
research
∙
07/10/2013
Tractable Combinations of Global Constraints
We study the complexity of constraint satisfaction problems involving gl...
research
∙
03/08/2011
The tractability of CSP classes defined by forbidden patterns
The constraint satisfaction problem (CSP) is a general problem central t...
research
∙
11/12/2008
