{'fraction_non_alphanumeric': 0.02536997885835095, 'fraction_numerical': 0.0, 'mean_word_length': 5.0, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Performance of parallel branch-and-bound algorithms

Consideration is given to the performance of parallel best-bound-first branch-and-bound algorithms in which several nodes with least lower bounds are expanded simultaneously. It is well known that anomalies may occur in the execution of a parallel branch-and-bound algorithm. The authors show the conditions under which anomalies are guaranteed not to occur when the number of processors is doubled, or not even doubled.