{'fraction_non_alphanumeric': 0.02510460251046025, 'fraction_numerical': 0.014225941422594143, 'mean_word_length': 5.164948453608248, '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}}
An implicit enumeration scheme for the batch selection problem

An important problem arising in the management of logistic networks is the following: given a set of activities to be performed, each requiring a set of resources, select the optimal set of resources compatible with the system capacity constraints. This problem is called Batch Selection Problem (BSP) from traditional applications to flexible manufacturing. BSP is known to be NP‐hard, and is also considered a difficult integer programming problem. In fact, polyhedral approaches to BSP suffer from the poor quality of the bound provided by the linear relaxation, even after strengthening. We devise an implicit enumeration scheme that attempts to overcome this difficulty. It is based on a formulation of BSP, which is equivalent to a stable set problem with one side constraint. This allows to exploit the upper bound, not only for pruning subproblems, but also for controlling the number and the quality of the subproblems generated. We show the effectiveness of the approach by an extensive computational experience on real‐sized randomly generated instances. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(2), 151–159 2004