Tree local search

被引：0

作者：

Prcovic, N ^{[1
]}

机构：

[1] UMR CNRS 6168, Lab Sci Informat & Syst, F-13397 Marseille 20, France

来源：

PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2003, PROCEEDINGS | 2003年 / 2833卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

This paper presents Tree Local Search (TLS), a generic algorithm that hybridizes tree and local search methods. It has the following properties: it can filter all its instantiations and allows to freely select the variable whose value changes in case of failure. The primitive version of TLS can be regarded as a Hill-Climbing method that handles filtered instantiations. An extended version generalizes the Backtracking and Min-Conflicts algorithms.

引用

页码：935 / 939

页数：5