Degeneracy graphs: Theory and applications. An updated survey
From MaRDI portal
Publication:1312751
DOI10.1007/BF02096258zbMATH Open0786.90080OpenAlexW1970179431MaRDI QIDQ1312751FDOQ1312751
Authors: Tomas Gal 
Publication date: 7 February 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02096258
Recommendations
Programming involving graphs or networks (90C35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pivot selection methods of the Devex LP code
- Title not available (Why is that?)
- New Finite Pivoting Rules for the Simplex Method
- A practical anti-cycling procedure for linearly constrained optimization
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Optimality and Degeneracy in Linear Programming
- A dual approach to primal degeneracy
- Title not available (Why is that?)
- Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
- On the solution of highly degenerate linear programmes
- A new pivoting rule for solving various degeneracy problems
- Title not available (Why is that?)
- Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
- Title not available (Why is that?)
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
- Redundancy in mathematical programming. A state-of-the-art survey
- An algorithm for determining all extreme points of a convex polytope
- Practical finite pivoting rules for the simplex method
- Theoretical Properties of the Network Simplex Method
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- An analysis of degeneracy
- A Technique for Resolving Degeneracy in Linear Programming
- On cycling in the network simplex method
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- The alternating basis algorithm for assignment problems
- An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
- Weakly redundant constraints and their impact on postoptimal analyses in LP
- Probabilistic Models for Linear Programming
- A note on degeneracy in linear programming
- Title not available (Why is that?)
- A Note on Shadow Prices in Linear Programming
- The Computation of Shadow Prices in Linear Programming
- Marginal Values in Linear Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Survey of solved and open problems in the degeneracy phenomenon
- Geometry of the Gass-Saaty parametric cost LP algorithm
- The generalized alternating path algorithm for transportation problems
- An improved vertex enumeration algorithm
- On the structure of the set bases of a degenerate point
- Bounds on the number of vertices of perturbed polyhedra
- Degeneracy graphs and simplex cycling
- On the average length of lexicographic paths
- Pivoting rules and redundancy schemes in extreme point enumeration
- Degeneracy graphs and the neighbourhood problem
- A theory of degeneracy graphs
- Title not available (Why is that?)
- Occurrences of cycling and other phenomena arising in a class of linear programming models
- Parametric linear programming and anti-cycling pivoting rules
- New criteria for the simplex algorithm
- Title not available (Why is that?)
- An algorithm for enumerating all vertices of a convex polyhedron
- Title not available (Why is that?)
- On some properties of \(0\)-degeneracy graphs
- An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
- Degeneracy in integer linear optimization problems: A selected bibliography
- A decision rule in the simplex method that avoids cycling
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems
- Cycling in the transportation problem
- Title not available (Why is that?)
- A note on cycling in the simplex method
Cited In (13)
- On the connectedness of optimum-degeneracy graphs
- On some properties of \(0\)-degeneracy graphs
- A Primal–Dual Lifting Scheme for Two-Stage Robust Optimization
- Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm
- An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
- Simplex adjacency graphs in linear optimization
- Survey of solved and open problems in the degeneracy phenomenon
- Weakly redundant constraints and their impact on postoptimal analyses in LP
- Title not available (Why is that?)
- A new pivoting rule for solving various degeneracy problems
- Tight Approximations of Degeneracy in Large Graphs
- Degeneracy graphs and the neighbourhood problem
- A theory of degeneracy graphs
Uses Software
This page was built for publication: Degeneracy graphs: Theory and applications. An updated survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1312751)
