{'fraction_non_alphanumeric': 0.012280701754385965, 'fraction_numerical': 0.0, 'mean_word_length': 4.598039215686274, '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}}
Investing in arcs in a network to maximize the expected max flow

Consider a network with arcs subject to failures. We show how the problem of investing in new arcs in such a network in order to increase the expected max flow as much as possible can be formulated as a stochastic program with network recourse. We show how to decompose the problem, and consider both exact methods and approximations. Convergence proofs are given. We demonstrate that max flow recourse problems can be solved very efficiently, since lower and upper bounds are equally simple to evaluate.