{'fraction_non_alphanumeric': 0.022660098522167486, 'fraction_numerical': 0.0, 'mean_word_length': 5.684210526315789, '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}}
Compact MILP models for the discrete cost multicommodity network design problem

We investigate a challenging NP-hard variant of Network Design Problems called the Discrete Cost Multicommodity Network Design Problem (DCMNDP), which arises in a wide range of real-life situations such as telecommunication settings, multicast routing and aircraft assignment. In graph theory terms, the DCMNDP requires designing a minimum cost network by installing at most one facility on each edge while the installed capacities permit the routing of a prescribed multi-commodity flow value. We focus on investigating polynomial-sized Mixed Integer Linear Programming (MILP) formulations. Besides a basic arc-flow formulation, two new overflow and flow aggregation based formulations are proposed. To improve the performance of the proposed formulations, valid cuts/constraints are appended. Preliminary computational results are conducted on real-world networks and randomly generated instances using a general-purpose MIP solver.