A new pivot selection rule for the network simplex algorithm

DOI10.1007/BF02614367MaRDI QIDQ1373743zbMATH OpenFDO

Authors P. T. Sokkalingam, Prabha Sharma, Ravindra K. Ahuja

Publication date 22 June 1998

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

minimum cost flowsimplex algorithmworst-case complexityminimum ratio pivot rulenetwork simplex pivot selection rule

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• The Scaling Network Simplex Algorithm
• scientific article; zbMATH DE number 1766755
• Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
• Publication:4488857

Cites work

• A genuinely polynomial primal simplex algorithm for the assignment problem
• A network simplex method
• Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
• Efficient Shortest Path Simplex Algorithms
• Network flows. Theory, algorithms, and applications.
• On the simplex algorithm for networks and generalized networks
• Parametric shortest path algorithms with an application to cyclic staffing
• The Scaling Network Simplex Algorithm
• Theoretical Properties of the Network Simplex Method

Cited in

(10)

• scientific article; zbMATH DE number 4126976 (Why is no real title available?)
• scientific article; zbMATH DE number 1766755 (Why is no real title available?)
• New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels
• The Scaling Network Simplex Algorithm
• scientific article; zbMATH DE number 1471729 (Why is no real title available?)
• A network simplex algorithm with O(\(n\)) consecutive degenerate pivots
• A strongly polynomial simplex method for the linear fractional assignment problem
• On the simplex algorithm for networks and generalized networks
• Anti-stalling pivot rules for the network simplex algorithm
• A comparison of pivot selection rules for primal simplex based network codes

This page was built for publication: A new pivot selection rule for the network simplex algorithm

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