A practical anti-degeneracy row selection technique in network linear programming

DOI10.1007/BF02023108zbMath0786.90040MaRDI QIDQ1312776

István Maros

Publication date: 5 May 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

degeneracypivotingcyclingminimal cost network flowprimal network simplex algorithm

Mathematics Subject Classification ID

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

Related Items (1)

Algorithms for network piecewise-linear programs: A comparative study

Uses Software

• DIMACS
• DEVEX

Cites Work

• A practical anti-cycling procedure for linearly constrained optimization
• Anti-stalling pivot rules for the network simplex algorithm
• An efficient implementation of the network simplex method
• Traffic scheduling via Benders decomposition
• Pivot Strategies for Primal-Simplex Network Codes
• Theoretical Properties of the Network Simplex Method
• A Technique for Resolving Degeneracy in Linear Programming
• Pivot selection methods of the Devex LP code

This page was built for publication: A practical anti-degeneracy row selection technique in network linear programming