{'fraction_non_alphanumeric': 0.02242152466367713, 'fraction_numerical': 0.002242152466367713, 'mean_word_length': 5.04054054054054, '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}}
Quadratic Assignment Problems (QAP) and Its Size Reduction Method

The Quadratic Assignment Problem (QAP) is a discrete optimization problem which can be found in economics, operations research, and engineering. It seeks to locate N facilities among N fixed locations in the most economical way. This paper gives a brief introduction to QAP and discusses how to reduce the problem size to N-1 if the original problem satisfies certain conditions.