New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels

DOI10.1007/s10589-007-9144-7zbMath1170.90511OpenAlexW2020730893MaRDI QIDQ839681

N. E. Zubov

Publication date: 2 September 2009

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9144-7

zbMATH Keywords

shortest path problempseudo permanent labelsshortest path simplex algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05)

Related Items (1)

An efficient label setting/correcting shortest path algorithm

Cites Work

• Unnamed Item
• Shortest paths algorithms: Theory and experimental evaluation
• An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• On a routing problem
• Anti-stalling pivot rules for the network simplex algorithm
• On the simplex algorithm for networks and generalized networks
• Theoretical Properties of the Network Simplex Method
• Efficient Shortest Path Simplex Algorithms

This page was built for publication: New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels