Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956–1974)

DOI10.1002/net.1975.5.2.129zbMath0307.90078OpenAlexW2768047182MaRDI QIDQ4065317

A. R. Pierce

Publication date: 1975

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.1975.5.2.129

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Bibliographies for mathematics in general (00A15)

Related Items

Transitive closure and related semiring properties via eliminants ⋮ On the sum-max bicriterion path problem. ⋮ Unnamed Item ⋮ The quickest path problem ⋮ Algorithms for the quickest path problem and the enumeration of quickest paths ⋮ Minimum-weight spanning tree algorithms. A survey and empirical study ⋮ On the quickest path problem ⋮ Optimal control of store-and-forward networks ⋮ Algorithms for the constrained quickest path problem and the enumeration of quickest paths