{'fraction_non_alphanumeric': 0.027379400260756193, 'fraction_numerical': 0.005215123859191656, 'mean_word_length': 5.508474576271187, '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 constant approximation algorithm for the one-warehouse multi-retailer problem

Deterministic inventory theory provides streamlined optimization models that attempt to capture tradeoffs in managing the flow of goods through a supply chain. We will consider a well-studied inventory model, called the one-warehouse multi-retailer problem (OWMR). and give the first approximation algorithm with constant performance guarantee; more specifically, we give a 2.398-approximation algorithm. Our results are based on an LP-rounding approach, and hence not only provide good algorithmic results, but show strong integrality gaps for these linear programs. Furthermore, we extend this result to obtain a constant performance guarantee for a capacitated variant of this model.