A decomposition algorithm for shortest paths in a network with many strongly connected components

DOI10.1007/BF02026598zbMath0285.90077OpenAlexW2063196049MaRDI QIDQ4772994

Peter Brucker

Publication date: 1974

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02026598

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (1)

Some optimal path problems subject to improvements

Uses Software

• Algorithm 97

Cites Work

• A Decomposition Algorithm for Shortest Paths in a Network
• Unnamed Item

This page was built for publication: A decomposition algorithm for shortest paths in a network with many strongly connected components