{'fraction_non_alphanumeric': 0.02676056338028169, 'fraction_numerical': 0.0, 'mean_word_length': 5.522935779816514, '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}}
A Semidefinite Optimization Approach to the Directed Circular Facility Layout Problem

Abstract We propose a new combinatorial optimization problem, the so-called Directed Circular Facility Layout Problem (DCFLP). The (DCFLP) seems to be quite interesting as it contains several other problems that have been discussed extensively in literature as special cases. We show that the (DCFLP) is closely related to the Single-Row Facility Layout Problem (SRFLP) and hence we adapt the leading algorithmic method for the (SRFLP) by suggesting an appropriate modelling approach for the (DCFLP). Finally we show that this algorithmic approach yields promising computational results on a variety of benchmark instances.