{'fraction_non_alphanumeric': 0.018036072144288578, 'fraction_numerical': 0.0, 'mean_word_length': 4.808139534883721, '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}}
Discrete Optimization The Steiner cycle polytope

This article introduces a new problem called Steiner cycle problem (SCP), closely related to the widely-studied travelling salesman problem (TSP) and the Steiner tree problem. Given an undirected graph G with a penalty associated to each node and a cost to each edge, and given a subset of nodes W, the problem consists on finding a simple cycle in G visiting at least the nodes in W and minimizing the sum of the costs of edges in the cycle plus the penalties of nodes not in the cycle. This problem finds applications in the optimal design of telecommunication systems, and generalizes the known TSP and the weighted Girth problem. We analyze the polyhedral structure associated to the SCP introducing two lifting procedures to extend facet-defining inequalities from the travelling salesman polytope. The obtained results can be applied to the weighted Girth problem. Moreover, they can also be used in a cutting-plane approach to solve the SCP.