A network simplex algorithm with O(\(n\)) consecutive degenerate pivots

DOI10.1016/S0167-6377(02)00114-1zbMath1010.90096OpenAlexW1991572031WikidataQ59592546 ScholiaQ59592546MaRDI QIDQ1866978

Prabha Sharma, P. T. Sokkalingam, James B. Orlin, Ravindra K. Ahuja

Publication date: 2 April 2003

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00114-1

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Extreme-point and pivoting methods (90C49)

Related Items (3)

A network simplex method for the budget-constrained minimum cost flow problem ⋮ A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals ⋮ A strongly polynomial simplex method for the linear fractional assignment problem

Cites Work

• Unnamed Item
• Negative-cycle detection algorithms
• A polynomial time primal network simplex algorithm for minimum cost flows
• Anti-stalling pivot rules for the network simplex algorithm
• A network simplex method
• Theoretical Properties of the Network Simplex Method

This page was built for publication: A network simplex algorithm with O(\(n\)) consecutive degenerate pivots