Technical Note—On Hu's Decomposition Algorithm for Shortest Paths in a Network

DOI10.1287/opre.19.4.983zbMath0235.90055OpenAlexW2085579965MaRDI QIDQ5645229

Jin Y. Yen

Publication date: 1971

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.19.4.983

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

A very personal reminiscence on the problem of computational complexity ⋮ Shortest path and closure algorithms for banded matrices ⋮ A decomposition algorithm for optimality problems in tree-structured networks ⋮ BRIDGE LANE DIRECTION SPECIFICATION FOR SUSTAINABLE TRAFFIC MANAGEMENT

This page was built for publication: Technical Note—On Hu's Decomposition Algorithm for Shortest Paths in a Network