A demand-expanded SAT encoding with infeasible-orientation elimination certifies two to three times more optimal solutions for the 2D-CSSP than OR-Tools, CPLEX, or Gurobi on the Cui-Zhao suite.
An innovative genetic algorithm for a multi- objective optimization of two-dimensional cutting-stock problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Solving the Two-dimensional single stock size Cutting Stock Problem with SAT and MaxSAT
A demand-expanded SAT encoding with infeasible-orientation elimination certifies two to three times more optimal solutions for the 2D-CSSP than OR-Tools, CPLEX, or Gurobi on the Cui-Zhao suite.