Dynamic selection of enumeration strategies in constraint programming

BRODERICK CRAWFORD LABRIN, Mauricio Montecinos, Carlos Castro, Eric Monfroy

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

Abstract

In this work we exploit search process features to dynamically adapt a Constraint Programming solver in order to more efficiently solve Constraint Satisfaction Problems. The main novelty of our approach is that we reconfigure the search based solely on performance data gathered while solving the current problem. We report encouraging results where our combination of strategies outperforms the use of individual strategies.

Original languageEnglish
Title of host publicationAnnals of DAAAM for 2009 and Proceedings of the 20th International DAAAM Symposium "Intelligent Manufacturing and Automation
Subtitle of host publicationFocus on Theory, Practice and Education"
PublisherDanube Adria Association for Automation and Manufacturing, DAAAM
Pages1331-1332
Number of pages2
ISBN (Print)9783901509704
StatePublished - 1 Jan 2009
EventAnnals of DAAAM for 2009 and 20th International DAAAM Symposium "Intelligent Manufacturing and Automation: Focus on Theory, Practice and Education" - Vienna, Austria
Duration: 25 Nov 200928 Nov 2009

Publication series

NameAnnals of DAAAM and Proceedings of the International DAAAM Symposium
ISSN (Print)1726-9679

Conference

ConferenceAnnals of DAAAM for 2009 and 20th International DAAAM Symposium "Intelligent Manufacturing and Automation: Focus on Theory, Practice and Education"
CountryAustria
CityVienna
Period25/11/0928/11/09

Keywords

  • Constraint programming
  • Enumeration strategies
  • Value ordering heuristics
  • Variable ordering heuristics

Fingerprint Dive into the research topics of 'Dynamic selection of enumeration strategies in constraint programming'. Together they form a unique fingerprint.

Cite this