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

The Best-First Search strategy (BeFS) and the Depth-First Search strategy (DFS) are regarded as the prime strategies when solving combinatorial optimization problems by parallel Branch-and-Bound (B ) - BeFS because of efficiency with respect to the number of nodes explored, and DFS for reasons of sp...

Full description

Bibliographic Details

Published in:	Annals of operations research Vol. 90; pp. 1 - 17
Main Authors:	Clausen, J., Perregaard, M.
Format:	Journal Article
Language:	English
Published:	New York Springer Nature B.V 01.01.1999
Subjects:	Algorithms Children & youth Efficiency Experiments Job shops Operations research Optimization Scheduling Studies
ISSN:	0254-5330, 1572-9338
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!