On the best search strategy in parallel branch-and-bound : best-first-search vs. lazy depth-first-search. Nr. 96/16