Minimal and Redundant SAT Encodings for the All-Interval-Series Problem
Manyà Serres, Felip
MetadataShow full item record
The SAT encodings defined so far for the all-interval-series (ais) problem are very hard for local search but rather easy for systematic algorithms. We define different SAT encodings for the ais problem and provide experimental evidence that this problem can be efficiently solved with local search methods if one chooses a suitable SAT encoding.