{'fraction_non_alphanumeric': 0.02, 'fraction_numerical': 0.0, 'mean_word_length': 4.894117647058824, '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 Lot-Sizing Problem on Trees, Related to Network Design

We describe a capacity expansion problem on trees, which arises in the design of certain communications networks, and is related to the knapsack and the economic lot-sizing problems. One of the main features is that production takes place in fixed and possibly large batch sizes. Another feature is that there may be various commodities competing for capacity resources. We present various exact and e-approximate algorithms for this problem.