On the public citation graph
Selected bibliography on degeneracy
0 signed · 119 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nav.3800020406openalex-snapshot
Cycling in the dual simplex algorithm
inferredcites →https://doi.org/10.1002/nav.3800110104openalex-snapshot
Cycling in the transportation problem
inferredcites →https://doi.org/10.1002/nav.3800160110openalex-snapshot
A note on cycling in the simplex method
inferredcites →https://doi.org/10.1002/nav.3800160307openalex-snapshot
Time‐minimizing transportation problems
inferredcites →https://doi.org/10.1002/nav.3800260112openalex-snapshot
The enumeration of all efficient solutions for a linear multiple‐objective transportation problem
inferredcites →https://doi.org/10.1002/nav.3800270408openalex-snapshot
Solving multifacility location problems involving euclidean distances
inferredcites →https://doi.org/10.1002/nav.3800290116openalex-snapshot
A note on solving multifacility location problems involving euclidean distances
inferredcites →https://doi.org/10.1002/nav.3800290312openalex-snapshot
On three basic methods for solving bottleneck transportation problems
inferredcites →https://doi.org/10.1007/978-3-642-45535-3openalex-snapshot
Redundancy in Mathematical Programming
inferredcites →https://doi.org/10.1007/978-3-642-45702-9openalex-snapshot
Degeneracy Graphs and Simplex Cycling
inferredcites →https://doi.org/10.1007/978-3-642-46564-2_4openalex-snapshot
Algebraic fundamentals of linear programming
inferredcites →https://doi.org/10.1007/978-3-642-49270-9openalex-snapshot
Degeneracy Graphs and the Neighbourhood Problem
inferredcites →https://doi.org/10.1007/978-3-642-71161-9_4openalex-snapshot
Neuere Ansätze in der Linearen Optimierung —Motivation, Konzepte und Verfahren—
inferredcites →https://doi.org/10.1007/978-3-662-22160-0openalex-snapshot
Methodology and Software for Interactive Decision Support
inferredcites →https://doi.org/10.1007/bf00939135openalex-snapshot
On the structure of the set bases of a degenerate point
inferredcites →https://doi.org/10.1007/bf01386081openalex-snapshot
A decision rule in the simplex method that avoids cycling
inferredcites →https://doi.org/10.1007/bf01580108openalex-snapshot
Pivot selection methods of the Devex LP code
inferredcites →https://doi.org/10.1007/bf01580452openalex-snapshot
Degeneracy in fixed cost transportation problems
inferredcites →https://doi.org/10.1007/bf01580769openalex-snapshot
A simplex algorithm for piecewise-linear programming II: Finiteness, feasibility and degeneracy
inferredcites →https://doi.org/10.1007/bf01580770openalex-snapshot
Parametric linear programming and anti-cycling pivoting rules
inferredcites →https://doi.org/10.1007/bf01580776openalex-snapshot
On the solution of highly degenerate linear programmes
inferredcites →https://doi.org/10.1007/bf01580883openalex-snapshot
A regularized decomposition method for minimizing a sum of polyhedral functions
inferredcites →https://doi.org/10.1007/bf01580885openalex-snapshot
On the average length of lexicographic paths
inferredcites →https://doi.org/10.1007/bf01580886openalex-snapshot
A note on degeneracy in linear programming
inferredcites →https://doi.org/10.1007/bf01582098openalex-snapshot
Cycling in linear complementarity problems
inferredcites →https://doi.org/10.1007/bf01583778openalex-snapshot
An implementation of the simplex method for linear programming problems with variable upper bounds
inferredcites →https://doi.org/10.1007/bf01584319openalex-snapshot
The alternating basis algorithm for assignment problems
inferredcites →https://doi.org/10.1007/bf01584344openalex-snapshot
The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
inferredcites →https://doi.org/10.1007/bf01584348openalex-snapshot
Vector maximization at a degenerate vertex
inferredcites →https://doi.org/10.1007/bf01588308openalex-snapshot
Least-index resolution of degeneracy in quadratic programming
inferredcites →https://doi.org/10.1007/bf01589397openalex-snapshot
Survey of solved and open problems in the degeneracy phenomenon
inferredcites →https://doi.org/10.1007/bf01589398openalex-snapshot
A dual approach to primal degeneracy
inferredcites →https://doi.org/10.1007/bf01593771openalex-snapshot
An algorithm for determining all extreme points of a convex polytope
inferredcites →https://doi.org/10.1007/bf01609041openalex-snapshot
Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems
inferredcites →https://doi.org/10.1007/bf01719736openalex-snapshot
Shadow prices and sensitivity analysis in linear programming under degeneracy
inferredcites →https://doi.org/10.1007/bf01721801openalex-snapshot
Practical finite pivoting rules for the simplex method
inferredcites →https://doi.org/10.1007/bf01935004openalex-snapshot
Pivoting rules and redundancy schemes in extreme point enumeration
inferredcites →https://doi.org/10.1007/bf02023098openalex-snapshot
Bounds on the number of vertices of perturbed polyhedra
inferredcites →https://doi.org/10.1007/bf02096258openalex-snapshot
Degeneracy graphs: theory and application an updated survey
inferredcites →https://doi.org/10.1007/bf02096259openalex-snapshot
Degeneracy in interior point methods for linear programming: a survey
inferredcites →https://doi.org/10.1007/bf02096263openalex-snapshot
Degeneracy in integer linear optimization problems: A selected bibliography
inferredcites →https://doi.org/10.1007/bf02242366openalex-snapshot
An algorithm for enumerating all vertices of a convex polyhedron
inferredcites →https://doi.org/10.1007/bf02253740openalex-snapshot
On the choice of the pivot columns of the Simplex-method: Gradient criteria
inferredcites →https://doi.org/10.1007/bf02591947openalex-snapshot
Formal optimization of some reduced linear programming problems
inferredcites →https://doi.org/10.1007/bf02592024openalex-snapshot
A variation on Karmarkar’s algorithm for solving linear programming problems
inferredcites →https://doi.org/10.1007/bf02592054openalex-snapshot
On cycling in the network simplex method
inferredcites →https://doi.org/10.1007/bf02592073openalex-snapshot
Projected gradient methods for linearly constrained problems
inferredcites →https://doi.org/10.1007/bfb0093145openalex-snapshot
A second-order method for solving the continuous multifacility location problem
inferredcites →https://doi.org/10.1007/bfb0121193openalex-snapshot
An algorithm for finding hamiltonian circuits in certain graphs
inferredcites →https://doi.org/10.1016/0024-3795(89)90464-3openalex-snapshot
Making progress during a stall in the simplex algorithm
inferredcites →https://doi.org/10.1016/0024-3795(91)90277-4openalex-snapshot
On finding a vertex solution using interior point methods
inferredcites →https://doi.org/10.1016/0167-6377(85)90017-3openalex-snapshot
Minimax linear programming problem
inferredcites →https://doi.org/10.1016/0167-6377(87)90009-5openalex-snapshot
A possible way to reduce degeneracy in integer programming computations
inferredcites →https://doi.org/10.1016/0167-6377(88)90071-5openalex-snapshot
On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
inferredcites →https://doi.org/10.1016/0167-6377(89)90051-5openalex-snapshot
A new algorithm to find all vertices of a polytope
inferredcites →https://doi.org/10.1016/0167-6377(91)90058-wopenalex-snapshot
On anti-cycling pivoting rules for the simplex method
inferredcites →https://doi.org/10.1016/0167-6377(92)90058-bopenalex-snapshot
A new pivoting rule for solving various degeneracy problems
inferredcites →https://doi.org/10.1016/0305-0483(76)90124-9openalex-snapshot
How many-sided are shadow prices at degenerate primal optima?
inferredcites →https://doi.org/10.1016/0305-0548(86)90034-1openalex-snapshot
An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
inferredcites →https://doi.org/10.1016/0377-2217(77)90063-7openalex-snapshot
A general method for determining the set of all efficient solutions to a linear vectormaximum problem
inferredcites →https://doi.org/10.1016/0377-2217(78)90110-8openalex-snapshot
The generalized alternating path algorithm for transportation problems
inferredcites →https://doi.org/10.1016/0377-2217(82)90178-3openalex-snapshot
On the bottleneck linear programming problem
inferredcites →https://doi.org/10.1016/0377-2217(82)90180-1openalex-snapshot
An improved vertex enumeration algorithm
inferredcites →https://doi.org/10.1016/0377-2217(92)90083-lopenalex-snapshot
Weakly redundant constraints and their impact on postoptimal analyses in LP
inferredcites →https://doi.org/10.1016/s0377-2217(87)80153-4openalex-snapshot
The explicit derivation of the efficient portfolio frontier in the case of degeneracy and general singularity
inferredcites →https://doi.org/10.1017/s1446788700039513openalex-snapshot
Stationarity in the simplex method
inferredcites →https://doi.org/10.1057/jors.1967.28openalex-snapshot
A Note on Resolution of Degeneracy in Transportation Problems
inferredcites →https://doi.org/10.1057/jors.1976.145openalex-snapshot
An Efficient Computational Procedure for Solving the Multi-Facility Rectilinear Facilities Location Problem
inferredcites →https://doi.org/10.1057/jors.1982.118openalex-snapshot
The Computation of Shadow Prices in Linear Programming
inferredcites →https://doi.org/10.1057/jors.1984.83openalex-snapshot
A Note on Shadow Prices in Linear Programming
inferredcites →https://doi.org/10.1090/conm/114/1097870openalex-snapshot
Some results concerning convergence of the affine scaling algorithm
inferredcites →https://doi.org/10.1090/conm/114/1097871openalex-snapshot
Dual ellipsoids and degeneracy in the projective algorithm for linear programming
inferredcites →https://doi.org/10.1111/j.1540-5915.1982.tb00155.xopenalex-snapshot
DEGENERACY AND THE (MIS)INTERPRETATION OF SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING
inferredcites →https://doi.org/10.1111/j.1540-5915.1984.tb01193.xopenalex-snapshot
THE EFFECTS OF DEGENERACY ON COST‐COEFFICIENT RANGES AND AN ALGORITHM TO RESOLVE INTERPRETATION PROBLEMS
inferredcites →https://doi.org/10.1137/0109008openalex-snapshot
An Algorithm for Finding All Vertices of Convex Polyhedral Sets
inferredcites →https://doi.org/10.1137/0111006openalex-snapshot
Marginal Values in Linear Programming
inferredcites →https://doi.org/10.1137/0111016openalex-snapshot
A Technique for Resolving Degeneracy in Linear Programming
inferredcites →https://doi.org/10.1137/0715015openalex-snapshot
Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
inferredcites →https://doi.org/10.1137/0715017openalex-snapshot
On Cline’s Direct Method for Solving Overdetermined Linear Systems in the $L_\infty $ Sense
inferredcites →https://doi.org/10.1137/0901037openalex-snapshot
A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
inferredcites →https://doi.org/10.1145/103147.103155openalex-snapshot
On computational aspects of bounded linear least squares problems
inferredcites →https://doi.org/10.1287/mnsc.12.7.588openalex-snapshot
Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
inferredcites →https://doi.org/10.1287/moor.11.4.570openalex-snapshot
A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only
inferredcites →https://doi.org/10.1287/moor.16.4.671openalex-snapshot
Probabilistic Models for Linear Programming
inferredcites →https://doi.org/10.1287/moor.2.2.103openalex-snapshot
New Finite Pivoting Rules for the Simplex Method
inferredcites →https://doi.org/10.1287/moor.4.2.196openalex-snapshot
Theoretical Properties of the Network Simplex Method
inferredcites →https://doi.org/10.1287/moor.5.2.167openalex-snapshot
A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
inferredcites →https://doi.org/10.1287/moor.8.3.381openalex-snapshot
The Complexity of Vertex Enumeration Methods
inferredcites →https://doi.org/10.1287/opre.16.4.750openalex-snapshot
A Simplified Primal (All-Integer) Integer Programming Algorithm
inferredcites →https://doi.org/10.1287/opre.26.2.374openalex-snapshot
Letter to the Editor—On the Possibility of Cycling with the Simplex Method
inferredcites →https://doi.org/10.1287/opre.27.4.848openalex-snapshot
Letter to the Editor—Comments on the Possibility of Cycling with the Simplex Method
inferredcites →https://doi.org/10.1287/trsc.11.1.1openalex-snapshot
Determining Cost vs. Time Pareto-Optimal Frontiers in Multi-Modal Transportation Problems
inferredcites →https://doi.org/10.21236/ada100602openalex-snapshot
On Parametric Linear and Quadratic Programming Problems.
inferredcites →https://doi.org/10.2140/pjm.1955.5.183openalex-snapshot
The generalized simplex method for minimizing a linear form under linear inequality restraints
inferredcites →https://doi.org/10.2307/1907845openalex-snapshot
Optimality and Degeneracy in Linear Programming
inferredcites →https://doi.org/10.2307/1927010openalex-snapshot
Degeneracy in Linear Programming: A Simple Geometric Interpretation
inferredcites →https://doi.org/10.5784/6-1-478openalex-snapshot
Degeneracy problems in mathematical programming and degeneracy graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_341openalex-snapshot
Nondifferentiable Optimization: Parametric Programming
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_449openalex-snapshot
Nondifferentiable Optimization: Parametric Programming
inferred← citeshttps://doi.org/10.1007/978-1-4615-6103-3_4openalex-snapshot
Linear Programming 2: Degeneracy Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-46823-0_11openalex-snapshot
Degeneracy, Normality, Stability in Mathematical Programming
inferred← citeshttps://doi.org/10.1007/s10107-008-0254-5openalex-snapshot
Multi-phase dynamic constraint aggregation for set partitioning type problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.07.004openalex-snapshot
Stabilized dynamic constraint aggregation for solving set partitioning problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.03.019openalex-snapshot
A linear programming decomposition focusing on the span of the nondegenerate columns
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00023-5openalex-snapshot
How good are convex hull algorithms?
inferred← citeshttps://doi.org/10.1023/a:1010917903065openalex-snapshot
Stability in Linear Programming Models: An Index Set Approach
inferred← citeshttps://doi.org/10.1145/220279.220282openalex-snapshot
How good are convex hull algorithms?
inferred← citeshttps://doi.org/10.1145/3188745.3188820openalex-snapshot
The minimum Euclidean-norm point in a convex polytope: Wolfe's combinatorial algorithm is exponential
inferred← citeshttps://doi.org/10.15480/882.488openalex-snapshot
Rigorous Error Bounds for Finite Dimensional Linear Programming Problems
inferred← citeshttps://doi.org/10.24874/pes02.03.006openalex-snapshot
MODIFIED LEAST COST METHOD FOR SOLVING TRANSPORTATION PROBLEM
inferred← citeshttps://doi.org/10.2516/ogst:2007067openalex-snapshot
Allocation of CO2Emissions in Joint Product Industries via Linear Programming: a Refinery Example
inferred← citeshttps://doi.org/10.47749/t/unicamp.2024.1376703openalex-snapshot
Preços-sombra em problemas de programação linear com solução ótima primal degenerada
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.