A data structure boosting the performance of local search for CSP solving

E. Grégoire; Jean-Marie Lagniez; B. Mazure

A data structure boosting the performance of local search for CSP solving

E. Grégoire
, Jean-Marie Lagniez
, B. Mazure

Institute of Formal Models and Verification

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

Abstract

This paper is concerned with local search techniques (LS) for solving CSPs (Constraint Satisfaction Problems). An efficient data structure is presented that allows the performance of LS to be boosted. Experimentations on benchmarks from the last international CSP competitions illustrate its very positive impact. It has been implemented in wcsp: an efficient open-ended and open-source local search platform for CSP that can accommodate various meta-heuristics.

Original language	English
Title of host publication	Proc. of 4th International Conference on Metaheuristics and Nature Inspired Computing (META’2012)
Number of pages	2
Publication status	Published - Oct 2012

Fields of science

102011 Formal languages
102 Computer Sciences
101 Mathematics

JKU Focus areas

Computation in Informatics and Mathematics

Cite this

@inproceedings{723bac5ef51b4884ae35f2b04a05ab24,

title = "A data structure boosting the performance of local search for CSP solving",

abstract = "This paper is concerned with local search techniques (LS) for solving CSPs (Constraint Satisfaction Problems). An efficient data structure is presented that allows the performance of LS to be boosted. Experimentations on benchmarks from the last international CSP competitions illustrate its very positive impact. It has been implemented in wcsp: an efficient open-ended and open-source local search platform for CSP that can accommodate various meta-heuristics.",

author = "E. Gr{\'e}goire and Jean-Marie Lagniez and B. Mazure",

year = "2012",

month = oct,

language = "English",

booktitle = "Proc. of 4th International Conference on Metaheuristics and Nature Inspired Computing (META{\textquoteright}2012)",

}

TY - GEN

T1 - A data structure boosting the performance of local search for CSP solving

AU - Grégoire, E.

AU - Lagniez, Jean-Marie

AU - Mazure, B.

PY - 2012/10

Y1 - 2012/10

N2 - This paper is concerned with local search techniques (LS) for solving CSPs (Constraint Satisfaction Problems). An efficient data structure is presented that allows the performance of LS to be boosted. Experimentations on benchmarks from the last international CSP competitions illustrate its very positive impact. It has been implemented in wcsp: an efficient open-ended and open-source local search platform for CSP that can accommodate various meta-heuristics.

AB - This paper is concerned with local search techniques (LS) for solving CSPs (Constraint Satisfaction Problems). An efficient data structure is presented that allows the performance of LS to be boosted. Experimentations on benchmarks from the last international CSP competitions illustrate its very positive impact. It has been implemented in wcsp: an efficient open-ended and open-source local search platform for CSP that can accommodate various meta-heuristics.

M3 - Conference proceedings

BT - Proc. of 4th International Conference on Metaheuristics and Nature Inspired Computing (META’2012)

ER -