3 papers
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.LO2026
SAT Encodings for Bandwidth Coloring: A Systematic Design Study
Duc Trung Kim Nguyen, Tuyen Van Kieu, Khanh Van To
The Bandwidth Coloring Problem (BCP) generalizes graph coloring by enforcing minimum separation constraints between adjacent vertices and arises in frequency assignment application…
cs.LO2025
Compact SAT Encoding for Power Peak Minimization
Tuyen Van Kieu, Phong Chi Nguyen, Bao Gia Hoang +1
The Simple Assembly Line Balancing Problem with Power Peak Minimization (SALBP-3PM) minimizes maximum instantaneous power usage while assigning tasks to workstations and de…