Conflict directed backjumping for max-CSPs

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

1 Scopus citations

Abstract

Constraint Optimization problems are commonly solved using a Branch and Bound algorithm enhanced by consistency maintenance procedures (Wallace and Freuder 1993; Larrosa and Meseguer 1996; Larrosa et al. 1999; Larrosa and Schiex 2003; 2004). All these algorithms traverse the search space in a chronological order and gain their efficiency from the quality of the consistency maintenance procedure. The present study introduces Conflict-directed Backjumping (CBJ) for Branch and Bound algorithms. The proposed algorithm maintains Conflict Sets which include only assignments whose replacement can lead to a better solution. The algorithm backtracks according to these sets. CBJ can be added to all classes of the Branch and Bound algorithm. In particular to versions of Branch & Bound that use advanced maintenance procedures of soft local consistency levels, NC*, AC* and FDAC (Larrosa and Schiex 2003; 2004). The experimental evaluation of B&B_CBJ on random Max-CSPs shows that the performance of all algorithms is improved both in the number of assignments and in the time for completion.

Original languageEnglish
Title of host publicationHeuristic Search, Memory-Based Heuristics and their Applications - Papers from the AAAI Workshop, Technical Report
Pages71-78
Number of pages8
StatePublished - 1 Dec 2006
Event2006 AAAI Workshop - Boston, MA, United States
Duration: 16 Jul 200620 Jul 2006

Publication series

NameAAAI Workshop - Technical Report
VolumeWS-06-08

Conference

Conference2006 AAAI Workshop
Country/TerritoryUnited States
CityBoston, MA
Period16/07/0620/07/06

Fingerprint

Dive into the research topics of 'Conflict directed backjumping for max-CSPs'. Together they form a unique fingerprint.

Cite this