|
Avtomatika i Telemekhanika, 1977, Issue 2, Pages 88–91
(Mi at7289)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Developing Systems
Finding a shortest path in a graph using the minorant of the Bellman function
E. N. Orël Moscow
Abstract:
An algorithm is proposed for finding a shortest path in a graph using an arbitrary function which bounds the Bellman function from below. The algorithm sees only those vertices which are suspected functions of the desired path.
Received: 19.01.1976
Citation:
E. N. Orël, “Finding a shortest path in a graph using the minorant of the Bellman function”, Avtomat. i Telemekh., 1977, no. 2, 88–91; Autom. Remote Control, 38:2 (1977), 235–237
Linking options:
https://www.mathnet.ru/eng/at7289 https://www.mathnet.ru/eng/at/y1977/i2/p88
|
Statistics & downloads: |
Abstract page: | 90 | Full-text PDF : | 36 |
|