{'fraction_non_alphanumeric': 0.029350104821802937, 'fraction_numerical': 0.008385744234800839, 'mean_word_length': 5.45945945945946, '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 the p‐median polytope and the odd directed cycle inequalities: Oriented graphs

We study the classical linear programing relaxation of the p ‐median problem, together with the so‐called “odd directed cycle inequalities.” We characterize in terms of forbidden subgraphs, the oriented graphs for which this system of inequalities defines an integral polytope. This completes the study started in Baïou and Barahona (2016), where oriented graphs with no triangles were treated.