Asynchronous parallel branch and bound and anomalies

This publication has 8 references indexed in Scilit:

• A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functions
  Information Processing Letters, 1986
• Coping with Anomalies in Parallel Branch-and-Bound Algorithms
  IEEE Transactions on Computers, 1986
• Performance of parallel branch-and-bound algorithms
  IEEE Transactions on Computers, 1985
• Anomalies in parallel branch-and-bound algorithms
  Communications of the ACM, 1984
• Branching from the largest upper bound Folklore and facts
  European Journal of Operational Research, 1978
• The Power of Dominance Relations in Branch-and-Bound Algorithms
  Journal of the ACM, 1977
• Theoretical comparisons of search strategies in branch-and-bound algorithms
  International Journal of Parallel Programming, 1976
• Branch-and-Bound Methods: General Formulation and Properties
  Operations Research, 1970