On cycling in the network simplex method

DOI10.1007/BF02592054zbMath0516.90074OpenAlexW2019668690MaRDI QIDQ3664851

William H. Cunningham, John G. Klincewicz

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02592054

zbMATH Keywords

degeneracycyclingnetwork primal simplex methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Related Items

A network penalty method, A specialized network simplex algorithm for the constrained maximum flow problem, A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses, Systematic construction of examples for cycling in the simplex method, On the structure of the set bases of a degenerate point, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey, A comprehensive simplex-like algorithm for network optimization and perturbation analysis

Cites Work

• Unnamed Item
• A network simplex method
• The alternating basis algorithm for assignment problems
• Theoretical Properties of the Network Simplex Method
• Cycling in the transportation problem
• A note on cycling in the simplex method