| 约束满足问题求解及ILOG SOLVER系统简介 |
| |
| 引用本文： | 姜英新,孙吉贵.约束满足问题求解及ILOG SOLVER系统简介[J].吉林大学学报(理学版),2002,40(1):53-60. |
| |
| 作者姓名： | 姜英新 孙吉贵 |
| |
| 作者单位： | 吉林大学计算机科学与技术学院, 长春 130012 |
| |
| 基金项目： | 国家自然科学基金(批准号:60073039)、教育部骨干教师基金和吉林省自然科学基金(批准号:2000540). |
| |
| 摘 要： | 首先综述求解约束满足问题的基本算法和搜索策略,
然后介绍ILOG SOLVER求解系统提供的类和函数的基本组成, 并给出用该系统求解的两个地图着色示例.
|
| 关 键 词： | 约束满足问题 约束求解 搜索策略 |
| 文章编号： | 1671-5489(2002)01-0053-08 |
| 收稿时间： | 2001-04-20 |
| 修稿时间： | 2001年4月20日 |
Solving Constraint Satisfaction Problem and Brief Introduction to ILOG SOLVER System |
| |
| JIANG Ying xin,SUN Ji gui.Solving Constraint Satisfaction Problem and Brief Introduction to ILOG SOLVER System[J].Journal of Jilin University: Sci Ed,2002,40(1):53-60. |
| |
| Authors: | JIANG Ying xin SUN Ji gui |
| |
| Institution: | College of Computer Science and Technology, Jilin University, Changchun 130012, P.R.China |
| |
| Abstract: | Constraint satisfaction problem (CSP) is a problem composed of a finite set of variables, each of which is associated with a finite domain, and a set of constraints can be used to restrict the values of the variables to be simultaneously taken. The task for solving the problem is to assign a value to each variable satisfying all the constraints. In this article, the basic algorithm and search strategies for solving CSP are summarized for the first time. Then a CSP solving system ILOG SOLVER is introduced, which was developed by France ILOG company. Finally, two map coloring problem solutions are given by using this system. |
| |
| Keywords: | constraint satisfaction problem constraint solving search strategies |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文 |
