Skip to main navigation
Skip to search
Skip to main content
Maastricht University Home
Support & FAQ
Link opens in a new tab
Search content at Maastricht University
Home
Researchers
Publications
Activities
Press/Media
Prizes
Organisations
Dataset/Software
Projects
Solving Constraint Satisfaction problems with tree-decomposition
Arie M.C.A. Koster
*
,
C.P.M. van Hoesel
, A.W.J. Kolen
*
Corresponding author for this work
Quantitative Economics
Research output
:
Contribution to journal
›
Article
›
Academic
›
peer-review
455
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Solving Constraint Satisfaction problems with tree-decomposition'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Constraint Satisfaction Problem
100%
Tree Decomposition
100%
Partial Constraint Satisfaction Problem
100%
Problem-based
33%
Computational Study
33%
Medium Size
33%
Graph Problems
33%
Dynamic Programming Algorithm
33%
Assignment Problem
33%
Boolean
33%
Quadratic Program
33%
Quadratic Assignment Procedure
33%
MaxSAT
33%
Structure Tree
33%
Constraint Graph
33%
Reasonable Time
33%
Frequency Planning
33%
Bounding Technique
33%
INIS
constraints
100%
decomposition
100%
size
40%
algorithms
20%
planning
20%
graphs
20%
assignments
20%
dynamic programming
20%
Computer Science
Tree Decomposition
100%
Constraint Satisfaction Problems
100%
Assignment Problem
25%
Constraint Graph
25%
Dynamic Programming Algorithm
25%
Subgraphs
25%