{'fraction_non_alphanumeric': 0.015018773466833541, 'fraction_numerical': 0.0, 'mean_word_length': 5.451612903225806, '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}}
An Effective Approach for Solving the Binary Assignment Problem with Side Constraints

The binary assignment problem with a side constraint requiring the objective function to receive a specified value, which in general is an NP-hard problem, has been the focus of several papers in recent years. The current literature addresses various theoretical aspects of the problem, with a particular emphasis on a simplifying special case, but stops short of giving any computational experience. In this paper, we present a simple reformulation that enables the problem, and some of its extensions, to be solved by commonly available heuristic methods. We present preliminary computational experience with a Tabu search method that illustrates the effectiveness and computational robustness of the approach.