Show simple item record

dc.contributor.authorAlsinet, Teresa
dc.contributor.authorBéjar Torres, Ramón
dc.contributor.authorCabiscol i Teixidó, Alba
dc.contributor.authorFernàndez Camon, César
dc.contributor.authorManyà Serres, Felip
dc.date.accessioned2016-07-05T11:25:51Z
dc.date.issued2002
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/10459.1/57365
dc.description.abstractThe 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.ca_ES
dc.language.isoengca_ES
dc.publisherSpringer Verlagca_ES
dc.relation.isformatofReproducció del document publicat a https://doi.org/10.1007/3-540-36079-4_12ca_ES
dc.relation.ispartofLecture Notes in Computer Science, 2002, vol. 2504, p. 139-144ca_ES
dc.rights(c) Springer Verlag, 2002ca_ES
dc.titleMinimal and Redundant SAT Encodings for the All-Interval-Series Problemca_ES
dc.typearticleca_ES
dc.identifier.idgrec006639
dc.type.versionpublishedVersionca_ES
dc.rights.accessRightsinfo:eu-repo/semantics/restrictedAccessca_ES
dc.identifier.doihttps://doi.org/10.1007/3-540-36079-4_12
dc.date.embargoEndDate10000-01-01


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record