An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem
From MaRDI portal
Publication:2770116
DOI10.1287/opre.47.3.445zbMath0979.90116OpenAlexW2099123195MaRDI QIDQ2770116
Publication date: 7 February 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.47.3.445
Programming involving graphs or networks (90C35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (2)
New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels ⋮ SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY
This page was built for publication: An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem