From the 1 of 7 linked papers with an AI index.
7 papers
Compact SAT and MaxSAT Encodings for Business-to-Business Meeting Scheduling with Idle-Time Balancing
Long Duc Nguyen, Tuyen Van Kieu, Khanh Van To
Business-to-business meeting scheduling assigns requested pairwise meetings to time slots and locations under availability, capacity, conflict, and precedence constraints. The publ…
Proving Optimality for the Bandwidth Multicoloring Problem via SAT
Duc Trung Kim Nguyen, Khanh Van To
The paper introduces a SAT-based exact method for solving the Bandwidth Multicoloring Problem, providing a compact encoding and incremental solving that proves optimality for many…
An Efficient MaxSAT-DDD Approach for Train Rescheduling via Precedence Propagation and Hybrid AMO Encodings
Tuyen Van Kieu, Tan Huu Nguyen, Khanh Van To
Train rescheduling repairs disturbed timetables while enforcing train-path precedence, resource capacity, and delay objectives. Dynamic Discretization Discovery (DDD) avoids full t…
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 (…
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…
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…