A new pivot selection rule for the network simplex algorithm
From MaRDI portal
Publication:1373743
DOI10.1007/BF02614367zbMATH Open0889.90149MaRDI QIDQ1373743FDOQ1373743
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)
Recommendations
minimum cost flowsimplex algorithmworst-case complexityminimum ratio pivot rulenetwork simplex pivot selection rule
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Parametric shortest path algorithms with an application to cyclic staffing
- Theoretical Properties of the Network Simplex Method
- The Scaling Network Simplex Algorithm
- Efficient Shortest Path Simplex Algorithms
- A genuinely polynomial primal simplex algorithm for the assignment problem
- A network simplex method
- On the simplex algorithm for networks and generalized networks
- Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
Cited In (10)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels
- Title not available (Why is that?)
- The Scaling Network Simplex Algorithm
- A network simplex algorithm with O(\(n\)) consecutive degenerate pivots
- On the simplex algorithm for networks and generalized networks
- A strongly polynomial simplex method for the linear fractional assignment problem
- 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)
