The two-dimensional knapsack problem with splittable items in stacks

The two-dimensional knapsack problem consists in packing rectangular items into a single rectangular box such that the total value of packed items is maximized. In this article, we restrict to 2-stage nonexact guillotine cut packings and consider the variant with splittable items: each item can be horizontally cut as many times as needed, and a packing may contain only a portion of an item. This problem arises in the packing of semifluid items, like tubes of small radius, which has the property to behave like a fluid in one direction, and as a solid in the other directions. In addition, the items are to be packed into stable stacks, that is, at most one item can be laid on top of another item, necessarily wider than itself. We establish that this variant of the two-dimensional knapsack problem is NP-hard, and propose an integer linear formulation. We exhibit very strong dominance properties on the structure of extreme solutions, that we call canonical packings. This structure enables us to design polynomial time algorithms for some special cases and a pseudo-polynomial time algorithm for the general case. We also develop a Fully Polynomial Time Approximation Scheme (FPTAS) for the case where the height of each item does not exceed the height of the box. Finally, some numerical results are reported to assess the efficiency of our algorithms. (C) 2022 Elsevier Ltd. All rights reserved.

Automated summary

The article focuses on a variant of the two-dimensional knapsack problem that considers the possibility of splitting items and requires stable stacking. By proving the NP-hardness of the problem and establishing dominance properties of canonical packings, polynomial time algorithms and pseudo-polynomial time algorithms are proposed to address this problem.