{'fraction_non_alphanumeric': 0.018211920529801324, 'fraction_numerical': 0.0, 'mean_word_length': 4.7075471698113205, '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}}
Parametric Facility Location on a Tree Network with an Lp-Norm Cost Function

This paper examines the optimal location of a single facility on a tree network with the objective being to minimize the sum of weighted distances from each node measured by an Lp-norm-based cost function. Our goal is to trace the trajectory of the optimal location when the Lp-norm parameter p varies from one to infinity. Convexity of the objective function, when p is fixed, allows us to perform the parametric analysis. We characterize possible trajectory paths, and show that some surprising trajectory results can occur.