On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search

DOI10.1023/A:1018952429396zbMath0937.90089OpenAlexW1554631849MaRDI QIDQ1808184

Michael Perregaard, Jens Clausen

Publication date: 2 December 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018952429396

zbMATH Keywords

quadratic assignmentjob-shop schedulingsearch strategiesparallel branch and bound

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Parallel numerical computation (65Y05)

Related Items (10)

Global optimization of robust truss topology via mixed integer semidefinite programming ⋮ Scheduling problem in seru production system considering DeJong's learning effect and job splitting ⋮ Search methods for tile sets in patterned DNA self-assembly ⋮ Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms ⋮ Grouped variable selection with discrete optimization: computational and statistical perspectives ⋮ A nearly optimal randomized algorithm for explorable heap selection ⋮ PEBBL: an object-oriented framework for scalable parallel branch and bound ⋮ Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm ⋮ Tensor based approach to the numerical treatment of the parameter estimation problems in mathematical immunology ⋮ An efficient solution method to design the cost-minimizing platform portfolio

This page was built for publication: On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search