# A Beam Search Based Parallel Algorithm for the Two-Dimensional Strip Packing Problem

arXiv: https://arxiv.org/abs/2503.08711 · HTML: https://mlsanity.com/paper/2503.08711/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 0 of its 35 references that are in the map.
- First posted on arXiv 10 Mar 2025.

## Abstract (arXiv)

This paper introduces BSPA, a parallel algorithm that leverages beam search to address the two-dimensional strip packing problem. The study begins with a comprehensive review of existing approaches and methodologies, followed by a detailed presentation of the BSPA algorithm. Experimental results demonstrate the effectiveness of the proposed method. To facilitate further research, both the code and datasets are publicly available.