On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First Search
Authors:
- J. ClausenJCJ. Clausen
- M. PerregaardMPM. Perregaard
- 1 January 1999
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 90, 1-17
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Parallel branch-and-bound methods for thejob-shop scheduling problemAnnals of Operations Research, 1998
- Solving Large Quadratic Assignment Problems in ParallelComputational Optimization and Applications, 1997
- Parallel Branch and Bound — Principles and Personal Experiences1997
- Building a parallel branch and bound library1996
- Asynchronous parallel branch and bound and anomaliesLecture Notes in Computer Science, 1995
- A new exact algorithm for the solution of quadratic assignment problemsDiscrete Applied Mathematics, 1994
- A practical use of Jackson's preemptive schedule for solving the job shop problemAnnals of Operations Research, 1990
- A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functionsInformation Processing Letters, 1986
- Coping with Anomalies in Parallel Branch-and-Bound AlgorithmsIEEE Transactions on Computers, 1986
- Performance of parallel branch-and-bound algorithmsIEEE Transactions on Computers, 1985