LDS [1]} is given in Algorithm . It has applications in Constraint Programming and Combinatorial Optimization [2]}. It is a search strategy commonly used when a good heuristic on the possible actions is available for driving the search. The principle is to restrict the number of decisions deviating from the heuristic choices (i.e. a discrepancy) by a threshold. This will explore the subset of solutions that are likely to be good according to the heuristic, but it will also explore solutions where the heuristic has been reconsidered a given number of times (i.e. the number of discrepancies).
