The Scaling Network Simplex Algorithm
From MaRDI portal
Publication:3990557
DOI10.1287/OPRE.40.1.S5zbMath0825.90769OpenAlexW1970394074MaRDI QIDQ3990557
James B. Orlin, Ravindra K. Ahuja
Publication date: 28 June 1992
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.40.1.s5
Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (7)
A polynomial time primal network simplex algorithm for minimum cost flows ⋮ A new pivot selection rule for the network simplex algorithm ⋮ Improving bipartite graph edit distance approximation using various search strategies ⋮ Algorithms and codes for dense assignment problems: The state of the art ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ A strongly polynomial simplex method for the linear fractional assignment problem ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis
This page was built for publication: The Scaling Network Simplex Algorithm
