What is Depth-Bounded Discrepancy Search?

Suggested Answer

This procedure counts the depth of the last discrepancy in the search tree. Given a parameter step, DDS will first explore nodes with a depth less than step. After this exploration is complete, it will explore nodes with a depth between step and 2*step, and so on. DDS also takes a parameter width, that allows width number of discrepancies beyond the depth specified by the parameter step. The function IloDDSEvaluator implements this search strategy.