| k-边覆盖对策及其核心 |
| |
| 引用本文： | 刘艳枝,方奇志. k-边覆盖对策及其核心[J]. 应用数学, 2007, 20(1): 140-144 |
| |
| 作者姓名： | 刘艳枝 方奇志 |
| |
| 作者单位： | 中国海洋大学数学系,山东,青岛,266071 |
| |
| 摘 要： | 本文针对从图的k-边覆盖问题引出的合作对策模型，利用线性规划对偶理论得到了其核心非空的一个充分条件和构造核心分配的多项式时间算法，并将这一结果推广到了一般的k-集合覆盖对策模型中．
|
| 关 键 词： | 合作对策 核心 k-边覆盖 线性规划 对偶理论 |
| 文章编号： | 1001-9847(2007)01-0140-05 |
| 修稿时间： | 2006-06-12 |
k-Edge-Covering Game |
| |
| LIU Yan-zhi,FANG Qi-zhi. k-Edge-Covering Game[J]. Mathematica Applicata, 2007, 20(1): 140-144 |
| |
| Authors: | LIU Yan-zhi FANG Qi-zhi |
| |
| Affiliation: | Department of Mathematics,Ocean University of China ,Qingdao 266071 ,China |
| |
| Abstract: | We consider the k- edge-covering cooperative game arising from edge covering problem on graphs. A sufficient condition for the core nonemptiness is obtained by making use of duality theory of linear program. This leads to a polynomial time algorithm for constructing a core allocation. Furthermore,these results are generalized to k- set-covering games. |
| |
| Keywords: | Cooperative game Core k- edge-covering Linear program Dual theory |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
