| 两个图论问题的0—1规划模型 |
| |
| 引用本文： | 梁彩霞.两个图论问题的0—1规划模型[J].喀什师范学院学报,2008,29(3):21-22. |
| |
| 作者姓名： | 梁彩霞 |
| |
| 作者单位： | 肇庆学院,数学与信息科学学院,广东,肇庆,526061 |
| |
| 摘 要： | 引进图的覆盖向量和独立向量概念，以向量和矩阵为工具，把图的最小覆盖和最大对立集问题转化为0—1规划问题，从而给出了寻找图的最小覆盖和最大独立集的一个方法。
|
| 关 键 词： | 最小覆盖 最大独立集 0—1规划 |
| 文章编号： | 1006-432X(2008)03-0021-02 |
| 修稿时间： | 2007年12月26 |
The 0-1 Programming Model of Two Graph Theory Problems |
| |
| LIANG Cai-xia.The 0-1 Programming Model of Two Graph Theory Problems[J].Journal of Kashgar Teachers College,2008,29(3):21-22. |
| |
| Authors: | LIANG Cai-xia |
| |
| Institution: | LIANG Cai-xia (Faculty of Mathematics and Information Science.s, Zhaoqing University, Zhaoqing 526061 ,Guangdong,China) |
| |
| Abstract: | We introduce the idea of Covering vector and Independent vector for a graph,and transfer the problems of a Minimum Covering and maximum Independent Set of a graph into 0-1 Programming problem,and then simple methods of finding a Minimum Covering and maximum Independent Set of a graph are given. |
| |
| Keywords: | Minimum covering set Maximum independent set 0-1 Programming |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
