%0 Journal Article %1 journals/anor/ClausenP99 %A Clausen, Jens %A Perregaard, Michael %D 1999 %J Ann. Oper. Res. %K dblp %P 1-17 %T On the best search strategy in parallel branch-and-bound: Best-First Search versus Lazy Depth-First Search. %U http://dblp.uni-trier.de/db/journals/anor/anor90.html#ClausenP99 %V 90

@article{journals/anor/ClausenP99, added-at = {2020-08-13T00:00:00.000+0200}, author = {Clausen, Jens and Perregaard, Michael}, biburl = {https://www.bibsonomy.org/bibtex/20e3b073d1626027e5e775c7864e36225/dblp}, ee = {https://doi.org/10.1023/A%3A1018952429396}, interhash = {05c39e9e25e53542e6cb0d8f4a3ecfcd}, intrahash = {0e3b073d1626027e5e775c7864e36225}, journal = {Ann. Oper. Res.}, keywords = {dblp}, pages = {1-17}, timestamp = {2020-08-14T11:36:30.000+0200}, title = {On the best search strategy in parallel branch-and-bound: Best-First Search versus Lazy Depth-First Search.}, url = {http://dblp.uni-trier.de/db/journals/anor/anor90.html#ClausenP99}, volume = 90, year = 1999 }