期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2013
卷号：56
期号：3
出版社：Journal of Theoretical and Applied
摘要：Many important computational problems may be formulated as constraint satisfaction problems (CSP). In this paper, we propose a new approach to solve the binary CSP problems using the continuous Hopfield networks (CHN). This approach is divided into three steps: the first concerns reducing the size of the CSP problems using arc consistency technique AC3. The second step involves modeling the filtered constraint satisfaction problems as 0-1 quadratic programming subject to linear constraints. The last step concerns applying the continuous Hopfield networks to solve the obtained 0-1 optimization model. Therefore, the mapping procedure and an appropriate parameter setting procedure about CSP problems are given in detail. Finally, some computational experiments solving the CSP problems are shown.
