✦ LIBER ✦

A recurrent neural network for solving the shortest path problem

✍ Scribed by Wang, J.

Book ID: 120828964
Publisher: IEEE
Year: 1996
Tongue: English
Weight: 527 KB
Volume: 43
Category: Article
ISSN: 1057-7122
DOI: 10.1109/81.503260

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A discrete-time recurrent neural network

A discrete-time recurrent neural network for shortest-path routing

✍ Jun Wang, ; Youshen Xia, 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 188 KB

A modified pulse coupled neural network

A modified pulse coupled neural network for shortest-path problem

✍ Xiaobin Wang; Hong Qu; Zhang Yi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 271 KB

A neural network for shortest path compu

A neural network for shortest path computation

✍ Araujo, F.; Ribeiro, B.; Rodrigues, L. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 150 KB

Solving min-max shortest-path problems o

Solving min-max shortest-path problems on a network

✍ Ishwar Murthy; Shenq-Shyong Her 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 877 KB

In this article we consider the problem of determining a path between two nodes in a network that minimizes the maximum of r path length values associated with it. This problem has a direct application in scheduling. It also has indirect applications in a class of routing problems and when consideri

A Recurrent Neural Network for Solving B

A Recurrent Neural Network for Solving Bilevel Linear Programming Problem

✍ Xing He, ; Chuandong Li, ; Tingwen Huang, ; Chaojie Li, ; Junjian Huang, 📂 Article 📅 2014 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 283 KB

Solving the -shortest path problem with

Solving the -shortest path problem with time windows in a time varying network

✍ Konstantinos N. Androutsopoulos; Konstantinos G. Zografos 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 922 KB

The k-shortest path problem in a network with time dependent cost attributes arises in many transportation decisions including hazardous materials routing and urban trip planning. The present paper proposes a label setting algorithm for solving this problem given that departure and arrival are const