Computing shortest paths in networks derived from recurrence relations
Author:
- 1 May 1991
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 33 (5) , 363-377
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Bidirectional Heuristic Search AgainJournal of the ACM, 1983
- An Improved Bidirectional Heuristic Search AlgorithmJournal of the ACM, 1977
- Branch-and-Bound Strategies for Dynamic ProgrammingOperations Research, 1976
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968
- Assembly-Line Balancing—Dynamic Programming with Precedence ConstraintsOperations Research, 1963
- A note on two problems in connexion with graphsNumerische Mathematik, 1959