{'fraction_non_alphanumeric': 0.029234737747205503, 'fraction_numerical': 0.005159071367153913, 'mean_word_length': 5.126315789473685, '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}}
One-dimensional relaxations and LP bounds for orthogonal packing

We consider the feasibility problem in d-dimensional orthogonal packing (d2), called the Orthogonal Packing Problem (OPP): given a set of d-dimensional rectangular items, decide whether all of them can be orthogonally packed in the given rectangular container without rotation. We review two kinds of one-dimensional (1D) relaxations of OPP. The first kind is non-preemptive cumulative-resource scheduling, equivalently 1D contiguous stock cutting. The second kind is simple (preemptive) 1D stock cutting. In three and more dimensions we distinguish the so-called bar and slice preemptive relaxations of OPP. We review some models of these problems and compare the strength of their LP relaxations with regard to a certain OPP instance, theoretically and numerically. Both the theory and computational results in 2D and 3D show the advantage of the bar relaxation. We also compare the LP bounds with the commonly used volume bounds from dual-feasible functions. Moreover, we test the so-called probing (temporary fixing) of intersection variables of OPP with the aim to strengthen the relaxations.