A Decomposition Algorithm for Shortest Paths in a Network
From MaRDI portal
Publication:5538325
DOI10.1287/opre.16.1.91zbMath0155.28802OpenAlexW2166818331MaRDI QIDQ5538325
No author found.
Publication date: 1968
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.16.1.91
Related Items (10)
[https://portal.mardi4nfdi.de/wiki/Publication:5558934 Eine Bemerkung zum Tripel-Algorithmus zur Bestimmung der k�rzesten Wege in einem Graphen] ⋮ Large-scale network analysis with applications to transportation, communication and inference networks ⋮ Some problems in discrete optimization ⋮ Kürzeste Wege in gemischten Netzen ⋮ Shortest-path queries in static networks ⋮ A decomposition algorithm for optimality problems in tree-structured networks ⋮ Traffic flow information for minimum cost routing procedures ⋮ The longest path in a network ⋮ On shortest-path algorithms in the topological design of computer networks: a comparative study ⋮ A decomposition algorithm for shortest paths in a network with many strongly connected components
This page was built for publication: A Decomposition Algorithm for Shortest Paths in a Network
