In this paper, we introduce an ongoing work regarding a hybrid approach usable for obtaining high quality solutions to large-scale combinatorial optimization problems. This approach divides the process of solving a global problem into a master process that performs constraint-based search and a slave process that uses specific incomplete search techniques. In this hybrid architecture, the master level takes advantage of the conflicts discovered during incomplete search at the slave level, and reciprocally enhances the efficiency of the incomplete search since conflicts collected by the master level are used to avoid visiting the same parts of the search space over and over again. One of the novelties of this work is that the conflicts are memorized over the long-term in compact data structures, namely OBDDs or MDDs. The experimental results obtained on OPTW and FJSP instances show that even in our preliminary implementation, this kind of approach can reach some best-known results.