{'fraction_non_alphanumeric': 0.026217228464419477, 'fraction_numerical': 0.0, 'mean_word_length': 5.913793103448276, '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}}
On Bounds Available from Branch-and-Price Decomposition of the Multi-dimensional Knapsack Problem with Generalized Upper Bound Constraints

This paper describes and evaluates alternative branch-and-price decompositions (B&P-Ds) of the multi-dimensional knapsack problem with generalized upper bound constraints both analytically and computationally. As part of our theoretical analysis we compare the bounds available from B&P-Ds with three alternative relaxations (Lagrangean relaxation, Lagrangean decomposition, and Surrogate relaxation) and whether incorporating a surrogate constraint can make an improvement or not. Our computational tests compare alternative ways of implementing B&P-D to assess the trade off between the tightness of resulting bounds and the run times required to obtain them.