On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
scientific article; zbMATH DE number 1373548