Efficient Shortest Path Simplex Algorithms

DOI10.1287/opre.38.4.624zbMath0723.90083OpenAlexW2013627567MaRDI QIDQ5202040

Jianxiu Hao, Sheng-Roan Kai, Donald Goldfarb

Publication date: 1990

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.38.4.624

zbMATH Keywords

labelingworst-case boundshortest path simplex algorithmlabel- correcting algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels ⋮ A polynomial time primal network simplex algorithm for minimum cost flows ⋮ A new pivot selection rule for the network simplex algorithm ⋮ A Friendly Smoothed Analysis of the Simplex Method ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ Polynomial-time primal simplex algorithms for the minimum cost network flow problem ⋮ SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY ⋮ On the \(K\) shortest path trees problem ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis ⋮ The fuzzy shortest path problem and its most vital arcs ⋮ The single most vital arc in the most economical path problem -- a parametric analysis

This page was built for publication: Efficient Shortest Path Simplex Algorithms