Showing cs.AIShow all
2 papers · 1 filter
cs.AI2026
Solving the Two-dimensional single stock size Cutting Stock Problem with SAT and MaxSAT
Tuyen Van Kieu, Chi Linh Hoang, Khanh Van To
Cutting rectangular items from stock sheets to satisfy demands while minimizing waste is a central manufacturing task. The Two-Dimensional Single Stock Size Cutting Stock Problem (…
cs.AI2026
Solving Cyclic Antibandwidth Problem by SAT
Hieu Truong Xuan, Khanh To Van
The Cyclic Antibandwidth Problem (CABP), a variant of the Antibandwidth Problem, is an NP-hard graph labeling problem with numerous applications. Despite significant research effor…