On cycling in the network simplex method

DOI10.1007/BF02592054MaRDI QIDQ3664851zbMATH OpenOpenAlexFDO

Authors 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

cyclingdegeneracynetwork primal simplex methods

Mathematics Subject Classification ID

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

Cites work

• A network simplex method
• A note on cycling in the simplex method
• Cycling in the transportation problem
• scientific article; zbMATH DE number 3775289 (Why is no real title available?)
• The alternating basis algorithm for assignment problems
• Theoretical Properties of the Network Simplex Method

Cited in

(8)

• A network penalty method
• Selected bibliography on degeneracy
• Degeneracy graphs: Theory and applications. An updated survey
• Systematic construction of examples for cycling in the simplex method
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• 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
• On the structure of the set bases of a degenerate point

This page was built for publication: On cycling in the network simplex method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3664851)