{'fraction_non_alphanumeric': 0.024390243902439025, 'fraction_numerical': 0.0022172949002217295, 'mean_word_length': 5.142857142857143, '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}}
Column generation for solving a compressor scheduling problem

The scheduling of compressors to gas-lifted oil wells can be thought of as a generalized facility location problem. The facilities (compressors) output a lift-gas rate at a pressure that depends nonlinearly on the rate. The clients (wells) demand lift-gas at given rates and pressures. The problem consists in deciding upon the installation of facilities to meet the demands of the clients, while keeping installation and operating costs to a minimum. Compressor scheduling is a mixed-integer nonlinear programming problem. This paper develops a column generation formulation that renders the problem a purely 0-1 program. To cope with the exponential number of columns (assignments of compressors to subsets of wells), a reduced master problem is obtained and the pricing sub-problem is approximated with a piecewise-linear reformulation.