On some properties of \(0\)-degeneracy graphs

DOI10.1007/BF02023106zbMath0803.05038MaRDI QIDQ1312774

Hermann-Josef Kruse

Publication date: 30 October 1994

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

zbMATH Keywords

complexitylinear programmingconnectivitydegeneracy graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Connectivity (05C40)

Related Items

On the connectedness of optimum-degeneracy graphs ⋮ Degenerate optimal basis graphs in linear programming ⋮ Degeneracy graphs: Theory and applications. An updated survey

Cites Work

• Unnamed Item
• Unnamed Item
• On the structure of the set bases of a degenerate point
• Degeneracy graphs and the neighbourhood problem
• Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
• Survey of solved and open problems in the degeneracy phenomenon
• A new pivoting rule for solving various degeneracy problems
• An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• An analysis of degeneracy
• The Computation of Shadow Prices in Linear Programming
• New Finite Pivoting Rules for the Simplex Method
• Optimality and Degeneracy in Linear Programming