bandwidth multicoloring 1combinatorial optimization 1constraint programming 1exact algorithms 1sat solving 1
From the 1 of 2 linked papers with an AI index.
2 papers
cs.LO2026
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…
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…