Sistema de Biblioteca

Adaptive hybridization strategies

DSpace/Manakin Repository

Search DSpace

Advanced Search

Show simple item record

Autor Monfroy E.
Autor Castro C.
Autor Crawford B.
Autor Figueroa C.
Fecha Ingreso 2014-04-05T00:14:14Z
Fecha Disponible 2014-04-05T00:14:14Z
Fecha en Repositorio 2014-04-04
dc.identifier 10.1145/1982185.1982387
dc.description.abstract During the last decades, significant improvements have been achieved for solving complex combinatorial optimization problems issued from real world applications. To tackle large scale instances and intricate problem structures, sophisticated solving techniques have been developed, combined, and hybridized to provide efficient solvers. Combinatorial problems are often modeled as Constraint Satisfaction Problems or constraint optimization problems, which consist of a set of variables, a set of possible values for these variables and a set of constraints to be satisfied. However, solvers or hybridization of solvers become more and more complex: the user must select various solving and hybridization strategies and tune numerous parameters. Moreover, it is well-known that an a priori decision concerning strategies and parameters is very difficult since strategies and parameters effects are rather unpredictable and may change during solving. © 2011 Authors. en_US
dc.source Proceedings of the ACM Symposium on Applied Computing
Link Descarga dc.source.uri
Title dc.title Adaptive hybridization strategies en_US
Tipo dc.type Conference Paper
dc.description.keywords Combinatorial optimization problems; Combinatorial problem; Constraint optimization problems; Constraint Satisfaction Problems; Problem structure; Real-world application; Optimization; Combinatorial optimization en_US

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record