Solving the Nearly Symmetric All-Pairs Shortest-Path Problem

DOI10.1287/ijoc.2018.0873zbMath1451.90027OpenAlexW2984528568MaRDI QIDQ3386762

W. Matthew Carlyle, Gerald G. Brown

Publication date: 7 January 2021

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2018.0873

zbMATH Keywords

all-pairs shortest pathslabel-correcting algorithmsrepeated shortest-path algorithmsymmetric coststwo-queue

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Uses Software

• NETGEN
• Algorithm 97

Cites Work

• A note on two problems in connexion with graphs
• On a routing problem
• Reoptimization procedures in shortest path problem
• A New Polynomially Bounded Shortest Path Algorithm
• Shortest path methods: A unifying approach
• Algorithm 562: Shortest Path Lengths [H]
• Properties of Labeling Methods for Determining Shortest Path Trees
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• An exact method for finding shortest routes on a sphere, avoiding obstacles
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• A Theorem on Boolean Matrices

This page was built for publication: Solving the Nearly Symmetric All-Pairs Shortest-Path Problem