Local search with constraint propagation and conflict-based heuristics

Artificial Intelligence

Volumn 139, Issue 1, 2002, Pages 21-45

  Jussien, Narendra ^a   Lhomme, Olivier ^b  

^a ECOLE DES MINES DE NANTES   (France)

^b IBM   (United States)

Author keywords

Conflict based search; Constraint satisfaction; Hybrid search algorithm; Local search; Repair methods

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; POLYNOMIALS; SEARCH ENGINES;

FILTERING ALGORITHMS; LOCAL SEARCH;

CONSTRAINT THEORY;

EID: 0036641319     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00221-7     Document Type: Article

References (54)

1. A tabu search algorithm for the open shop problem
2. A computational study of the job-shop scheduling problem
3. A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem
4. Using CSP look-back techniques to solve exceptionally hard SAT instances
5. Arc consistency in dynamic constraint satisfaction problems
6. Arc-consistency and arc-consistency again
7. Generalizing partial order and dynamic backtracking
8. A branch and bound algorithm for the open-shop problem
9. Adjustment of heads and tails for the job-shop problem
10. Improving CLP scheduling with task intervals
11. A metalevel compiler of CLP(FD) and its combination with intelligent backtracking
12. Constraint propagation with interval labels
13. A constraint-based approach for examination timetabling using local repair techniques
14. Arc-consistency in dynamic CSPs is no more prohibitive
15. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
16. Dead-end driven learning
17. Large combinatorial optimization problem methodology for hybrid models and solutions
18. GSAT and dynamic backtracking
19. Dynamic backtracking
20. Tabu search
21. Open-shop scheduling to minimize finish time
22. A new lower bound for the open-shop problem
23. Using intelligent backtracking to improve branch and bound methods: An application to open-shop problems
24. e-constraints: Explanation-based constraint programming
25. Dynamic domain splitting for numeric CSP
26. Maintaining arc-consistency within dynamic backtracking
27. A comparison of ATMS and CSP techniques
28. Systematic and non-systematic search strategies
29. A tabu search algorithm for the open shop scheduling problem
30. Consistency techniques for numeric CSPs
31. Consistency in networks of relations
32. Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
33. Arc and path consistency revisited
34. A view of local search in constraint programming
35. A hybrid search architecture applied to hard random 3-SAT and low-autocorrelation binary sequences
36. Resource optimization in a TDMA/DSI system: The EUTELSAT approach
37. Hybrid algorithms for the constraint satisfaction problem
38. Domain filtering can degrade intelligent backtracking
39. Non-systematic search and learning: An empirical study
40. Combining local search and look-ahead for scheduling and constraint satisfaction problems
41. Nogood recording for static and dynamic constraint satisfaction problems
42. Domain-independent extensions to GSAT: Solving large structured satisfiability problems
43. A new method for solving hard satisfiability problems
44. Using constraint programming and local search methods to solve vehicle routing problems
45. Extending GENET with lazy arc consistency
46. Benchmarks for basic scheduling problems
47. Problèmes incohérents: Expliquer l'incohérence, restaurer la cohérence
48. Dynamic backtracking for dynamic CSPs
49. Solution reuse in dynamic constraint satisfaction problems
50. Weak-commitment search for solving constraint satisfaction problems