Technical Note—Shortest-Path Algorithms: A Comparison
From MaRDI portal
Publication:4111311
DOI10.1287/opre.24.6.1164zbMath0343.90050OpenAlexW2000687208MaRDI QIDQ4111311
Publication date: 1977
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.24.6.1164
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05)
Related Items (12)
Experimentation in optimization ⋮ A constructive aisle design model for unit-load warehouses with multiple pickup and deposit points ⋮ Dynamic penalty function method for the side constrained traffic assignment problem ⋮ A computational study of efficient shortest path algorithms ⋮ Probabilistic shortest path problems with budgetary constraints ⋮ A new algorithm to find the shortest paths between all pairs of nodes ⋮ Solving the minimum toll revenue problem in real transportation networks ⋮ Routing with nonlinear multiattribute cost functions ⋮ Path-based dynamic user equilibrium model with applications to strategic transportation planning ⋮ Shortest-path queries in static networks ⋮ An evaluation of mathematical programming and minicomputers ⋮ Shortest paths in networks with vector weights
This page was built for publication: Technical Note—Shortest-Path Algorithms: A Comparison
