{'fraction_non_alphanumeric': 0.02640845070422535, 'fraction_numerical': 0.02992957746478873, 'mean_word_length': 5.184782608695652, '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': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A survey of resource constrained shortest path problems: Exact solution approaches

This article surveys the main contributions that have appeared in the scientific literature addressing resource constrained shortest path problems. The aim of this work is twofold: to give a structured survey of the literature on this topic; to provide a starting point for researchers who want to address the problems at hand. The study is focused on the relevant contributions dealing with exact solution approaches. © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 62(3), 183‐200 2013