On the connectedness of optimum-degeneracy graphs

DOI10.1016/0377-2217(95)00139-5zbMath0954.90059OpenAlexW2022882969MaRDI QIDQ1278372

Peter Zörnig, Tomas Gal

Publication date: 9 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00139-5

zbMATH Keywords

linear programmingconnectivitydegeneracy graphsoptimum-degeneracy graphs

Mathematics Subject Classification ID

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

Related Items (1)

Sensitivity analysis of the optimal assignment.

Cites Work

• 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
• Degeneracy graphs and simplex cycling
• Degeneracy graphs: Theory and applications. An updated survey
• On some properties of \(0\)-degeneracy graphs
• A theory of degeneracy graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the connectedness of optimum-degeneracy graphs