Degeneracy graphs: Theory and applications. An updated survey
From MaRDI portal
(Redirected from Publication:1312751)
Recommendations
Cites work
- scientific article; zbMATH DE number 3167494 (Why is no real title available?)
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 3900488 (Why is no real title available?)
- scientific article; zbMATH DE number 3904322 (Why is no real title available?)
- scientific article; zbMATH DE number 3926668 (Why is no real title available?)
- scientific article; zbMATH DE number 3956805 (Why is no real title available?)
- scientific article; zbMATH DE number 3961338 (Why is no real title available?)
- scientific article; zbMATH DE number 4005973 (Why is no real title available?)
- scientific article; zbMATH DE number 4027201 (Why is no real title available?)
- scientific article; zbMATH DE number 4066615 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3791104 (Why is no real title available?)
- scientific article; zbMATH DE number 193128 (Why is no real title available?)
- scientific article; zbMATH DE number 3543799 (Why is no real title available?)
- scientific article; zbMATH DE number 3626518 (Why is no real title available?)
- scientific article; zbMATH DE number 3634009 (Why is no real title available?)
- scientific article; zbMATH DE number 194432 (Why is no real title available?)
- scientific article; zbMATH DE number 3223349 (Why is no real title available?)
- scientific article; zbMATH DE number 3244470 (Why is no real title available?)
- scientific article; zbMATH DE number 3296895 (Why is no real title available?)
- A Note on Shadow Prices in Linear Programming
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- A Technique for Resolving Degeneracy in Linear Programming
- A decision rule in the simplex method that avoids cycling
- A dual approach to primal degeneracy
- A new pivoting rule for solving various degeneracy problems
- A note on cycling in the simplex method
- A note on degeneracy in linear programming
- A practical anti-cycling procedure for linearly constrained optimization
- A theory of degeneracy graphs
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- An algorithm for determining all extreme points of a convex polytope
- An algorithm for enumerating all vertices of a convex polyhedron
- An analysis of degeneracy
- An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
- An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
- An improved vertex enumeration algorithm
- Bounds on the number of vertices of perturbed polyhedra
- Cycling in the transportation problem
- Degeneracy graphs and simplex cycling
- Degeneracy graphs and the neighbourhood problem
- Degeneracy in integer linear optimization problems: A selected bibliography
- Geometry of the Gass-Saaty parametric cost LP algorithm
- Marginal Values in Linear Programming
- New Finite Pivoting Rules for the Simplex Method
- New criteria for the simplex algorithm
- Occurrences of cycling and other phenomena arising in a class of linear programming models
- On cycling in the network simplex method
- On some properties of \(0\)-degeneracy graphs
- On the average length of lexicographic paths
- On the solution of highly degenerate linear programmes
- On the structure of the set bases of a degenerate point
- Optimality and Degeneracy in Linear Programming
- Parametric linear programming and anti-cycling pivoting rules
- Pivot selection methods of the Devex LP code
- Pivoting rules and redundancy schemes in extreme point enumeration
- Practical finite pivoting rules for the simplex method
- Probabilistic Models for Linear Programming
- Redundancy in mathematical programming. A state-of-the-art survey
- Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
- Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems
- Survey of solved and open problems in the degeneracy phenomenon
- Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
- The Computation of Shadow Prices in Linear Programming
- The alternating basis algorithm for assignment problems
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- The generalized alternating path algorithm for transportation problems
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- Theoretical Properties of the Network Simplex Method
- Weakly redundant constraints and their impact on postoptimal analyses in LP
Cited in
(13)- On the connectedness of optimum-degeneracy graphs
- On some properties of \(0\)-degeneracy graphs
- 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
- scientific article; zbMATH DE number 89070 (Why is no real title available?)
- A primal-dual lifting scheme for two-stage robust optimization
- 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
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)
