2003
DOI: 10.1016/s0004-3702(02)00400-9
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid backtracking bounded by tree-decomposition of constraint networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
52
0
1

Year Published

2005
2005
2011
2011

Publication Types

Select...
4
2
1

Relationship

3
4

Authors

Journals

citations
Cited by 78 publications
(53 citation statements)
references
References 20 publications
0
52
0
1
Order By: Relevance
“…Note that Tree-Clustering does not provide interesting results in practical cases. So, an alternative approach, called BTD and also based on tree-decomposition of graphs, was proposed in [13]. It seems to provide empirical results among the best ones obtained by structural methods.…”
Section: Preliminariesmentioning
confidence: 99%
See 2 more Smart Citations
“…Note that Tree-Clustering does not provide interesting results in practical cases. So, an alternative approach, called BTD and also based on tree-decomposition of graphs, was proposed in [13]. It seems to provide empirical results among the best ones obtained by structural methods.…”
Section: Preliminariesmentioning
confidence: 99%
“…Such a space complexity is an important drawback which surely explains why most of performed works remains theoretical. Indeed, except [13,10], no practical results have been provided. Even for implemented methods, the amount of required memory may be problematic.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…This paper deals with the question of an efficient use of the considered decompositions. We focus on the BTD method (Backtracking on tree-decomposition [5]) which seems to be the most effective method proposed until now within the framework of these structural methods. Indeed, most of works based on this approach only present theoretical results, except [6,5].…”
Section: Introductionmentioning
confidence: 99%
“…We focus on the BTD method (Backtracking on tree-decomposition [5]) which seems to be the most effective method proposed until now within the framework of these structural methods. Indeed, most of works based on this approach only present theoretical results, except [6,5]. BTD proceeds by an enumerative search guided by a static pre-established partial order induced by a tree-decomposition of the constraint graph.…”
Section: Introductionmentioning
confidence: 99%