limited discrepancy search explore strategy

[guimarqu]

[codecov[bot]]

Codecov Report

Patch coverage: 95.00% and project coverage change: +0.04% :tada:

Comparison is base (ac69a88) 82.65% compared to head (aea8ba1) 82.70%.

Additional details and impacted files

@@            Coverage Diff             @@
##           master    #1052      +/-   ##
==========================================
+ Coverage   82.65%   82.70%   +0.04%     
==========================================
  Files          89       89              
  Lines        7022     7041      +19     
==========================================
+ Hits         5804     5823      +19     
  Misses       1218     1218              

Files Changed	Coverage Δ
src/TreeSearch/explore.jl	97.67% <95.00%> (+1.84%)	:arrow_up:

:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.

[guimarqu]

I agree, I'll move the code so we can qualify it as a tree search algorithm. It won't the implemantation of the lds though. We'll have to figure out how we can transmit the number of exepected children to the divide algorithm.

[rrsadykov]

My understanding is that there should be a storage unit which keeps the tabu list of variables forbidden to the added to the partial solution. The dive algorithm generates the children as long as the size of the tabu list is not more than the maximum size (which is a parameter of the dive algorithm). There is another parameter which is the maximum depth, if the current depth is larger than the maximum one, one only child should be generated.