A theoretical evaluation of selected backtracking algorithms

Artificial Intelligence

Volumn 89, Issue 1-2, 1997, Pages 365-387

  Kondrak, Grzegorz ^a   Van Beek, Peter ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Backtracking; Constraint satisfaction

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; EFFICIENCY; EVALUATION; OPTIMIZATION; PERFORMANCE;

BACK TRACKING;

TRACKING (POSITION);

EID: 0030716539     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(96)00027-6     Document Type: Article

References (20)

1. F. Bacchus and P. van Run, Dynamic variable ordering in CSPs, in: Proceedings First International Conference on Principles and Practice of Constraint Programming, Cassis, Lecture Notes in Computer Science 976 (Springer, Berlin, 1995) 258-275.
2. J.R. Bitner and E.M. Reingold, Backtrack programming techniques, Commun. ACM 18 (1975) 651-656.
3. M. Bruynooghe, Solving combinatorial search problems by intelligent backtracking, Inform. Process. Lett. 12 (1981) 36-39.
4. R. Dechter, Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition, Artif. Intell. 41 (1990) 273-312.
5. J. Gaschnig, A general backtracking algorithm that eliminates most redundant tests, in: Proceedings IJCAI-77, Cambridge, MA (1977) 457.
6. J. Gaschnig, Experimental case studies of backtrack vs. waltz-type vs. new algorithms for satisficing assignment problems, in: Proceedings 2nd Biennial Conference of the Canadian Society for Computational Studies of Intelligence, Toronto, Ont. (1978) 268-277.
7. M.L. Ginsberg, Dynamic backtracking, J. Artif. Intell. Res. 1 (1993) 25-46.
8. R.M. Haralick and G.L. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artif. Intell. 14 (1980) 263-313.
9. G. Kondrak, A theoretical evaluation of selected backtracking algorithms, Tech. Rept. TR94-10, University of Alberta, Edmonton, Alta. (1994).
10. A.K. Mackworth, Constraint satisfaction, in: S.C. Shapiro, ed., Encyclopedia of Artificial Intelligence (Wiley, New York, 2nd ed., 1992) 285-293.
11. J.J. McGregor, Relational consistency algorithms and their application in finding subgraph and graph isomorphisms, Inform. Sci. 19 (1979) 229-250.
12. U. Montanari, Networks of constraints: fundamental properties and applications to picture processing, Inform. Sci. 7 (1974) 95-132.
13. B.A. Nadel, Constraint satisfaction algorithms, Comput. Intell. 5 (1989) 188-224.
14. B.A. Nadel, Representation selection for constraint satisfaction: a case study using n-queens, IEEE Expert 5 (3) (1990) 16-23.
15. B. Nudel, Consistent-labeling problems and their algorithms: expected-complexities and theory-based heuristics, Artif. Intell. 21 (1983) 135-178.
16. P. Prosser, Hybrid algorithms for the constraint satisfaction problem, Comput. Intell. 9 (1993) 268-299.
17. D. Sabin and E.C. Freuder, Contradicting conventional wisdom in constraint satisfaction, in: Proceedings 11th European Conference on Artificial Intelligence, Amsterdam (1994) 125-129.
18. T. Schiex and G. Verfaillie, Nogood recording for static and dynamic constraint satisfaction problems, Int. J. Artif. Intell. Tools 3 (1994) 1-15.
19. B.M. Smith and S.A. Grant, Sparse constraint graphs and exceptionally hard problems, in: Proceedings IJCAI-95, Montreal, Que. (1995) 646-651.
20. E. Tsang, Foundations of Constraint Satisfaction (Academic Press, New York, 1993).