| 赋有权向量网络的字典序最短路 |
| |
| 引用本文： | 李仁豪.赋有权向量网络的字典序最短路[J].山东科技大学学报(自然科学版),1988(3). |
| |
| 作者姓名： | 李仁豪 |
| |
| 作者单位： | 山东矿业学院济南分院 |
| |
| 摘 要： | 本文以多目标优化设计为背景,提出了赋有权向量网络的字典序最短路概念。在字典序极小的意义下,推广了最短路问题的Dijkstra算法和Floyd算法,讨论了算法的复杂性,为一类问题的多目标优化决策提供了一种工具。
|
| 关 键 词： | 网络 权向量 字典序最短路 Pareto最短路 |
LEXICOGRAPHICAL ORDER SHORTEST PATH IN NETWORK WITH VECTOR WEIGHTS |
| |
| Li Renhao.LEXICOGRAPHICAL ORDER SHORTEST PATH IN NETWORK WITH VECTOR WEIGHTS[J].Journal of Shandong Univ of Sci and Technol: Nat Sci,1988(3). |
| |
| Authors: | Li Renhao |
| |
| Institution: | Jlnan Division of Inst |
| |
| Abstract: | This paper takes the Multi-Objective Programming as background, and introduces the concept of shortest path based on lexicographical order in a directed network, each arc of which is associated with Vector weights,also the Dijkstra algorithm and Floyd algorithm of shortest path problem in the network is developed, and the computational efficiency is discussed |
| |
| Keywords: | network vector weight olexicographical shortest path pareto shortest path |
| 本文献已被 CNKI 等数据库收录！ |
|
