The Scaling Network Simplex Algorithm

DOI10.1287/OPRE.40.1.S5MaRDI QIDQ3990557zbMATH OpenOpenAlexFDO

Authors Ravindra K. Ahuja, James B. Orlin

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

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• A new pivot selection rule for the network simplex algorithm
• Faster Scaling Algorithms for Network Problems
• A polynomial time primal network simplex algorithm for minimum cost flows
• Polynomial-time primal simplex algorithms for the minimum cost network flow problem
• Polynomial dual network simplex algorithms

Cited in

(20)

• An affine scaling method for solving network flow problems
• scientific article; zbMATH DE number 4126976 (Why is no real title available?)
• scientific article; zbMATH DE number 1766755 (Why is no real title available?)
• scientific article; zbMATH DE number 1869742 (Why is no real title available?)
• Scaling algorithms for network problems
• A polynomial time primal network simplex algorithm for minimum cost flows
• New scaling algorithms for the assignment and minimum mean cycle problems
• A new pivot selection rule for the network simplex algorithm
• scientific article; zbMATH DE number 1471729 (Why is no real title available?)
• Exterior point simplex-type algorithms for linear and network optimization problems
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• An O(nm)-time network simplex algorithm for the shortest path problem
• Improving bipartite graph edit distance approximation using various search strategies
• A strongly polynomial simplex method for the linear fractional assignment problem
• A competitive (dual) simplex method for the assignment problem
• Polynomial-time primal simplex algorithms for the minimum cost network flow problem
• Polynomial dual network simplex algorithms
• Scaling: a canonical design problem for networks
• Algorithms and codes for dense assignment problems: The state of the art
• Faster Scaling Algorithms for Network Problems

This page was built for publication: The Scaling Network Simplex Algorithm

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