The cascade algorithm for finding all shortest distances in a directed graph
| Year of publication: |
1967
|
|---|---|
| Authors: | Farbey, B. A. ; Land, A. H. ; Murchland, J. D. |
| Published in: |
Management science : journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : INFORMS, ISSN 0025-1909, ZDB-ID 206345-1. - Vol. 14.1967, 1, p. 19-28
|
| Subject: | Mathematische Statistik | Graphentheorie | Graph theory | Algorithmus | Algorithm | Operations Research | Operations research |
-
An improved multiobjective shortest path algorithm
Maristany de las Casas, Pedro, (2021)
-
Exact algorithms for bi-objective ring tree problems with reliability measures
Hill, Alessandro, (2018)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
- More ...
-
The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph
Farbey, B. A., (1967)
-
An application of "linear programming" to the transport of coking coal
Land, A. H., (1957)
-
Factor endowments and factor prices
Land, A. H., (1959)
- More ...