计算机工程2002，Vol.28Issue(z1)：58-61,4.
A Primal-dual Neural Network for Shortest Path Problem
A Primal-dual Neural Network for Shortest Path Problem
摘要
Abstract
The shortest path (SP) problem is a classical combinatorial optimization problem which plays an important role in a packet-switched computer and communication network. A new primal-dual neural network to solve the shortest path problem (PDSPN) is presented in this paper. The proposed neural network combines many features such as no network coefficients set,easy implementation in a VLSI circuit, and is proved to be completely stable to the exact solutions. The simulation example shows its efficiency in finding the "optimum" path(s) for data transmission in computer and communication network.关键词
Shortest path: Primal-dual/Neural network: OptimizationKey words
Shortest path: Primal-dual/Neural network: Optimization分类
信息技术与安全科学引用本文复制引用
.. A Primal-dual Neural Network for Shortest Path Problem[J].计算机工程,2002,28(z1):58-61,4.基金项目
This paper is supported in part by national key laboratory of communication fund (No. 00JS04.4.1 .JB3801 ) （No. 00JS04.4.1 .JB3801 ）
