Hi,I have two questions please: 1- I want to know the theoretical principle of LDSB for symmetry breaking.
2- if in an algorithm i would combine a branch and bound algorithm with the use of the LDSB layer for symmetry reduction ( declaration of symmetries), so how the solver (algorithm) works ? Can someone explain to me the sequential steps of the execution of the set (Branch and bound, LDSB). Thank you in advance. Cordially.
_______________________________________________ Gecode users mailing list users@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
