Adaptive hybridization strategies

Eric Monfroy, Carlos Castro, Broderick Crawford, Christian Figueroa

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations


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.

Original languageEnglish
Title of host publication26th Annual ACM Symposium on Applied Computing, SAC 2011
Number of pages2
StatePublished - 2011
Event26th Annual ACM Symposium on Applied Computing, SAC 2011 - TaiChung, Taiwan, Province of China
Duration: 21 Mar 201124 Mar 2011

Publication series

NameProceedings of the ACM Symposium on Applied Computing


Conference26th Annual ACM Symposium on Applied Computing, SAC 2011
Country/TerritoryTaiwan, Province of China


Dive into the research topics of 'Adaptive hybridization strategies'. Together they form a unique fingerprint.

Cite this