To access the full text documents, please follow this link: http://hdl.handle.net/10459.1/57365

Title:	Minimal and Redundant SAT Encodings for the All-Interval-Series Problem
Author:	Alsinet, Teresa; Béjar Torres, Ramón; Cabiscol i Teixidó, Alba; Fernàndez Camon, César; Manyà Serres, Felip
Notes:	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.
Rights:	(c) Springer Verlag, 2002 info:eu-repo/semantics/restrictedAccess
Document type:	article publishedVersion
Published by:	Springer Verlag
Share:

Full text files in this document

Show full item record