Solving the Two-dimensional single stock size Cutting Stock Problem with SAT and MaxSAT

1. 1Formulate the 2D-CSSP as a SAT problem by expanding item types by demand
2. 2Assign sheet-assignment variables to each item copy
3. 3Implement non-overlap constraints to prevent item overlap
4. 4Use MaxSAT to find the optimal solution that minimizes waste

This research benefits software engineers and AI researchers working on optimization problems, as well as manufacturers seeking to improve their cutting stock processes

💡 The 2D-CSSP can be effectively solved using SAT and MaxSAT techniques, reducing waste in manufacturing processes

💡 Minimize waste in cutting stock problems with SAT and MaxSAT!