A new pivot selection rule for the network simplex algorithm

DOI10.1007/BF02614367zbMath0889.90149MaRDI QIDQ1373743

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

Publication date: 22 June 1998

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

zbMATH Keywords

simplex algorithmminimum cost flowworst-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)

Related Items (1)

A strongly polynomial simplex method for the linear fractional assignment problem

Cites Work

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

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