On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
type: Item
instance of: scholarly article
title: On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
zbMATH Open document ID: 0937.90089
DOI: 10.1023/A:1018952429396
author: Jens Clausen
author: Michael Perregaard
published in: Annals of Operations Research
publication date: 1999-12-02T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 1373548
zbMATH Keywords: search strategies
zbMATH Keywords: parallel branch and bound
zbMATH Keywords: quadratic assignment
zbMATH Keywords: job-shop scheduling
MaRDI profile type: Publication
full work available at URL: a:1018952429396
OpenAlex ID: W1554631849
description: scientific article; zbMATH DE number 1373548