Standard Article

Backtrack Search Techniques And Heuristics

  1. Christophe Lecoutre

Published Online: 15 FEB 2011

DOI: 10.1002/9780470400531.eorms1011

Wiley Encyclopedia of Operations Research and Management Science

Wiley Encyclopedia of Operations Research and Management Science

How to Cite

Lecoutre, C. 2011. Backtrack Search Techniques And Heuristics. Wiley Encyclopedia of Operations Research and Management Science. .

Author Information

  1. CRIL-CNRS Université Lille-Nord de France, Lens, France

Publication History

  1. Published Online: 15 FEB 2011

Abstract

Satisfying a set of constraints is known as an instance of the constraint satisfaction problem (CSP), which is the subject of intense research in both artificial intelligence and operations research. Practical solution of CSP instances usually involves backtrack search. This is a complete approach that performs an exhaustive exploration of the search space of the instance to be solved. There have been considerable efforts during the last three decades to maximize the practical efficiency of backtrack search, relying on the concepts of constraint propagation, intelligent backtracking, restarting policy, variable (and value) ordering heuristic, and so on. In particular, the development of general-purpose adaptive heuristics has shown impressive progress in guiding search.

Keywords:

  • constraint network;
  • backtrack search;
  • consistencies;
  • intelligent backtracking;
  • restarts;
  • search heuristics;
  • variable ordering