| 赋有权向量网络的2-范数意义下的最短路 |
| |
| 引用本文： | 李仁豪. 赋有权向量网络的2-范数意义下的最短路[J]. 山东科技大学学报(自然科学版), 1990, 0(2) |
| |
| 作者姓名： | 李仁豪 |
| |
| 作者单位： | 济南分院 |
| |
| 摘 要： | 本文从资源的平衡消耗问题出发,提出了赋有权向量网络的2—范数意义下的最短路概念,讨论了算法,并以城市交通问题为例,说明了算法在多目标决策中的应用。
|
| 关 键 词： | 矩阵范数 通路 最短路 |
THE SHORTEST RATH UNDER,2-NORMS NETWORK WITH WEIGHTED VECTOR |
| |
| Li Renhao. THE SHORTEST RATH UNDER,2-NORMS NETWORK WITH WEIGHTED VECTOR[J]. Journal of Shandong Univ of Sci and Technol: Nat Sci, 1990, 0(2) |
| |
| Authors: | Li Renhao |
| |
| Affiliation: | Jinan Branch of SIMT. |
| |
| Abstract: | This paper takes the balance of resource consumption as background, and introduces the concept of the Shortest Path based on 2-Norm in a directed network, each arc of which is associated with weighted Vectors. The algorithm is also discussed. Finally, an example is given, which shows how to use this algorithm in the Multi-Objective Programming |
| |
| Keywords: | Matrix norm Pathway The Shortest path Weighted vector 2-Norm |
| 本文献已被 CNKI 等数据库收录！ |
|
