Name
Title | ||
|---|---|---|
Nogood Backmarking with Min-Conflict Repair in Constraint Satisfaction and Optimization |
Abstract | ||
|---|---|---|
There are generally three approaches to constraint satisfaction and optimization: domain-filtering,tree-search labelling and solution repair. The main attractions of repair-based algorithms over domainfilteringand/or tree-search algorithms seem to be their scalability, reactivity and applicability to optimizationproblems. The main detraction of the repair-based algorithms appear to be their failure toguarantee optimality. In this paper, a repair-based algorithm, that guarantees to find an... |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/3-540-58601-6_87 | PPCP |
Keywords | Field | DocType |
tabu search,no- good recording and no-good justification,simulated annealing,backjumping,dynamic backtracking,min-conflict repair,gsat and breakout.,learning,: constraint satisfaction and optimization,nogood backmarking,repair-based methods,backmarking,constraint satisfaction,search algorithm | Constraint satisfaction,Mathematical optimization,Guided Local Search,Local optimum,Computer science,Constraint learning,Backjumping,Backtracking,Tabu search,Hybrid algorithm (constraint satisfaction) | Conference |
ISBN | Citations | PageRank |
3-540-58601-6 | 9 | 0.59 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuejun Jiang | 1 | 21 | 2.46 |
| Thomas Richards | 2 | 9 | 1.27 |
| Barry Richards | 3 | 50 | 4.13 |