Degeneracy graphs: Theory and applications. An updated survey
type: Item
instance of: scholarly article
title: Degeneracy graphs: Theory and applications. An updated survey
zbMATH Open document ID: 0786.90080
DOI: 10.1007/BF02096258
author: Tomas Gal
published in: Annals of Operations Research
publication date: 1994-02-07T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90-02
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 495341
zbMATH Keywords: cycling
zbMATH Keywords: redundant constraints
zbMATH Keywords: sensitivity analysis
zbMATH Keywords: survey
zbMATH Keywords: degeneracy graphs
zbMATH Keywords: postoptimal analyses
describes a project that uses: DEVEX
MaRDI profile type: Publication
cites work: A Note on Shadow Prices in Linear Programming
cites work: An algorithm for enumerating all vertices of a convex polyhedron
cites work: Q5511850
cites work: Bounds on the number of vertices of perturbed polyhedra
cites work: The Computation of Shadow Prices in Linear Programming
cites work: Q4188659
cites work: A decision rule in the simplex method that avoids cycling
cites work: An Algorithm for Finding All Vertices of Convex Polyhedral Sets
cites work: On the average length of lexicographic paths
cites work: Q3968042
cites work: The alternating basis algorithm for assignment problems
cites work: The generalized alternating path algorithm for transportation problems
cites work: The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
cites work: New Finite Pivoting Rules for the Simplex Method
cites work: Q3757682
cites work: Optimality and Degeneracy in Linear Programming
cites work: New criteria for the simplex algorithm
cites work: Q3323698
cites work: Q3682229
cites work: Theoretical Properties of the Network Simplex Method
cites work: On cycling in the network simplex method
cites work: Q3844775
cites work: The generalized simplex method for minimizing a linear form under linear inequality restraints
cites work: An algorithm for determining all extreme points of a convex polytope
cites work: An improved vertex enumeration algorithm
cites work: Q4039985
cites work: Q3730340
cites work: Q4194726
cites work: On the structure of the set bases of a degenerate point
cites work: Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
cites work: Weakly redundant constraints and their impact on postoptimal analyses in LP
cites work: A new pivoting rule for solving various degeneracy problems
cites work: Survey of solved and open problems in the degeneracy phenomenon
cites work: Q3725859
cites work: Cycling in the transportation problem
cites work: An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
cites work: A practical anti-cycling procedure for linearly constrained optimization
cites work: Q4692387
cites work: An analysis of degeneracy
cites work: Q5531623
cites work: Q3285991
cites work: Pivot selection methods of the Devex LP code
cites work: A dual approach to primal degeneracy
cites work: Redundancy in mathematical programming. A state-of-the-art survey
cites work: Geometry of the Gass-Saaty parametric cost LP algorithm
cites work: Occurrences of cycling and other phenomena arising in a class of linear programming models
cites work: Degeneracy graphs and the neighbourhood problem
cites work: On some properties of \(0\)-degeneracy graphs
cites work: Parametric linear programming and anti-cycling pivoting rules
cites work: A note on cycling in the simplex method
cites work: An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
cites work: A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
cites work: A note on degeneracy in linear programming
cites work: Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems
cites work: Q3701215
cites work: Degeneracy in integer linear optimization problems: A selected bibliography
cites work: Q5580041
cites work: Practical finite pivoting rules for the simplex method
cites work: Q4118986
cites work: Q3768700

Degeneracy graphs: Theory and applications. An updated survey (cites work)
cites work: Q3678957

Degeneracy graphs: Theory and applications. An updated survey (cites work)
cites work: On the solution of highly degenerate linear programmes

Degeneracy graphs: Theory and applications. An updated survey (cites work)
cites work: An extreme-point-ranking algorithm for the extreme-point mathematical programming problem

Degeneracy graphs: Theory and applications. An updated survey (cites work)
cites work: Q3799811

Degeneracy graphs: Theory and applications. An updated survey (cites work)
cites work: Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems

Degeneracy graphs: Theory and applications. An updated survey (cites work)
cites work: Probabilistic Models for Linear Programming

Degeneracy graphs: Theory and applications. An updated survey (cites work)
cites work: Pivoting rules and redundancy schemes in extreme point enumeration

Degeneracy graphs: Theory and applications. An updated survey (cites work)
cites work: Marginal Values in Linear Programming

Degeneracy graphs: Theory and applications. An updated survey (cites work)
cites work: A Technique for Resolving Degeneracy in Linear Programming

Degeneracy graphs: Theory and applications. An updated survey (cites work)
cites work: Degeneracy graphs and simplex cycling

Degeneracy graphs: Theory and applications. An updated survey (cites work)
cites work: A theory of degeneracy graphs

Degeneracy graphs: Theory and applications. An updated survey (full work available at URL)
full work available at URL: https://doi.org/10.1007/bf02096258

Degeneracy graphs: Theory and applications. An updated survey (OpenAlex ID)
OpenAlex ID: W1970179431