On the best search strategy in parallel branch and bound best first search vs. lazy depth first search

Abstract: "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 & B) -- BeFS because of efficiency with respect to number of nodes explored, and...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Clausen, Jens (VerfasserIn), Perregaard, Michael (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	København 1996
Schriftenreihe:	Datalogisk Institut <København>: DIKU-Rapport 1996,16
Schlagworte:	Branch and bound algorithms Combinatorial optimization Operations research Parallel processing (Electronic computers)
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!