| 带模糊约束的最大流问题 |
| |
| 引用本文： | 汤泽滢,唐斌兵. 带模糊约束的最大流问题[J]. 模糊系统与数学, 2001, 15(4): 77-80 |
| |
| 作者姓名： | 汤泽滢 唐斌兵 |
| |
| 作者单位： | 1. 国防科技大学,理学院,
2. 国防科技大学,炮兵学院, |
| |
| 摘 要： | 首次提出带模糊约束的最大流问题,并根据网络中的弧容量限制是否带有模糊性,分别建立数学模型,给出求解这两个模型的相应算法和有关实例。
|
| 关 键 词： | 模糊约束 最大流 隶属函数 孤容量限制 网络流 算法 最小费用流 |
| 文章编号： | 1001-7402(2001)04-0077-04 |
| 修稿时间： | 1999-09-10 |
The Maximum Flow Problem with Fuzzy Constraints |
| |
| TANG Ze-ying,TANG Bin-bing. The Maximum Flow Problem with Fuzzy Constraints[J]. Fuzzy Systems and Mathematics, 2001, 15(4): 77-80 |
| |
| Authors: | TANG Ze-ying TANG Bin-bing |
| |
| Abstract: | In this paper, the maximum flow problem with fuzzy constraints is proposed for the first time. According to whether the arc capacity constraints in network are fuzzy or not,the corresponding methematical models are separately constructed. Furthermore, the efficient algorithms and relevant examples are presented. |
| |
| Keywords: | Fuzzy Constraint The Maximum Flow Membership Function |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
