Publication | Closed Access

On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First Search