Technical Note—Shortest-Path Algorithms: A Comparison

DOI10.1287/OPRE.24.6.1164MaRDI QIDQ4111311zbMATH OpenOpenAlexFDO

Authors Bruce Golden

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35)

Cited in

(12)

• Experimentation in optimization
• 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
• An evaluation of mathematical programming and minicomputers
• Path-based dynamic user equilibrium model with applications to strategic transportation planning
• Dynamic penalty function method for the side constrained traffic assignment problem
• A constructive aisle design model for unit-load warehouses with multiple pickup and deposit points
• Solving the minimum toll revenue problem in real transportation networks
• Shortest-path queries in static networks
• Routing with nonlinear multiattribute cost functions
• Shortest paths in networks with vector weights

This page was built for publication: Technical Note—Shortest-Path Algorithms: A Comparison

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4111311)