A Decomposition Algorithm for Shortest Paths in a Network

DOI10.1287/OPRE.16.1.91MaRDI QIDQ5538325zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

operations research

Cited in

(10)

• Large-scale network analysis with applications to transportation, communication and inference 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
• Kürzeste Wege in gemischten Netzen
• A decomposition algorithm for shortest paths in a network with many strongly connected components
• Shortest-path queries in static networks
• Eine Bemerkung zum Tripel-Algorithmus zur Bestimmung der k�rzesten Wege in einem Graphen
• Some problems in discrete optimization

This page was built for publication: A Decomposition Algorithm for Shortest Paths in a Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5538325)