Interleaving constraint propagation: An efficient cooperative search with branch and bound

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

2 Scopus citations

Abstract

The main characteristic of any constraint solver is Constraint propagation. Then it is very important to be able to manage constraint propagation as efficiently as possible, we present a hybrid solver based on a Branch and Bound algorithm combined with constraint propagation to reduce the search space. Based on some observations of the solving process constraint propagation is triggered by some rules. The results show that constraint propagation is profitable, but also that it is too costly to be executed at each node of the search tree, we show that is possible to make reasonable use of constraint propagation.

Original languageEnglish
Title of host publicationHybrid Metaheuristics - 8th International Workshop, HM 2013, Proceedings
Pages52-61
Number of pages10
DOIs
StatePublished - 30 Aug 2013
Event8th International Workshop on Hybrid Metaheuristics, HM 2013 - Ischia, Italy
Duration: 23 May 201325 May 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7919 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Workshop on Hybrid Metaheuristics, HM 2013
CountryItaly
CityIschia
Period23/05/1325/05/13

Fingerprint Dive into the research topics of 'Interleaving constraint propagation: An efficient cooperative search with branch and bound'. Together they form a unique fingerprint.

Cite this