Dimensions overall score 4.0

GitHub Code Pulse

No public code linked for this paper yet.

• The SAT-based framework for 2D-CSSP expands item types by demand and uses sheet-assignment variables with non-overlap constraints activated only for copies assigned to the same sheet.method 90%
• An infeasible-orientation elimination rule fixes rotation variables when only one orientation can fit the sheet.technical 90%
• For minimizing sheets, three SAT approaches are compared: non-incremental SAT with binary search, incremental SAT with clause reuse, and weighted partial MaxSAT.method 90%
• On the Cui--Zhao benchmark suite, the best SAT configurations certify two to three times more instances as provably optimal than OR-Tools, CPLEX and Gurobi.result 85%
• The relative ranking among SAT approaches depends on rotation: incremental SAT is strongest without rotation, while non-incremental SAT is more effective when rotation increases formula size.result 85%
• The 2D-CSSP generalizes bin packing by requiring multiple copies of each item type, causing a strong combinatorial blow-up.technical 80%
• The SAT-based approaches achieve lower optimality gaps than OR-Tools, CPLEX and Gurobi on the benchmark suite.result 85%

Competitive landscape

Competitor map is still being generated for this paper. Enable generation or check back soon.

Startup potential card