EFFICIENT SAT AND MAXSAT TECHNIQUES FOR SOLVING THE TWO-DIMENSIONAL STRIP PACKING PROBLEM
Tuyen Van Kieu et al.
What the paper says
The NP-hard Two-Dimensional Strip Packing Problem (2SPP) demands efficient exact solutions. This paper presents SAT-based Order Encoding models incorporating item rotation and adapted symmetry-breaking (SB). It compares three height-minimization strategies: Non-Incremental SAT Bisection, Incremental SAT Bisection, and Direct MaxSAT Optimization. Benchmarks on established 2SPP instances show our Non-Incremental SAT and Direct MaxSAT strategies significantly outperform earlier incremental techniques. Direct MaxSAT excelled for non-rotational 2SPP, while Non-Incremental SAT was superior for rotational cases among our methods. Google CP-SAT, integrated into our Non-Incremental Bisection search framework, performed best overall. Nevertheless, our specialized SAT/MaxSAT methods were highly competitive, outperforming other CP and MIP solvers. SB was generally beneficial. Item rotation increased encoding complexity; while yielding improved optimal heights for some instances, it did not increase the total number of instances solved optimally by our SAT/MaxSAT methods. This work offers insights into SAT/MaxSAT strategy trade-offs and their performance against general solvers.
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.50 × 0.4 = 0.20 |
| M · momentum | 0.50 × 0.15 = 0.07 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.