On the public citation graph
Parametric linear programming and anti-cycling pivoting rules
0 signed · 38 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/(issn)1931-9193openalex-snapshot
Naval Research Logistics Quarterly
inferredcites →https://doi.org/10.1002/nav.3800020406openalex-snapshot
Cycling in the dual simplex algorithm
inferredcites →https://doi.org/10.1007/bf01580645openalex-snapshot
Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
inferredcites →https://doi.org/10.1007/bf01580646openalex-snapshot
Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
inferredcites →https://doi.org/10.1007/bf01917108openalex-snapshot
The Average number of pivot steps required by the Simplex-Method is polynomial
inferredcites →https://doi.org/10.1007/bf02591902openalex-snapshot
On the average number of steps of the simplex method of linear programming
inferredcites →https://doi.org/10.1016/0095-8956(85)90042-5openalex-snapshot
Linear and quadratic programming in oriented matroids
inferredcites →https://doi.org/10.1137/0111016openalex-snapshot
A Technique for Resolving Degeneracy in 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.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.2307/1907816openalex-snapshot
Activity Analysis of Production and Allocation
inferredcites →https://doi.org/10.2307/1907845openalex-snapshot
Optimality and Degeneracy in Linear Programming
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_323openalex-snapshot
Multiparametric Linear Programming
inferred← citeshttps://doi.org/10.1007/978-0-387-39934-8_14openalex-snapshot
Toward Exposing the Applicability of Gass & Saaty’s Parametric Programming Procedure
inferred← citeshttps://doi.org/10.1007/978-0-387-39934-8_2openalex-snapshot
Four Score Years of Saul I. Gass: Portrait of an OR Professional
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_427openalex-snapshot
Multiparametric Linear Programming
inferred← citeshttps://doi.org/10.1007/978-1-4613-3449-1_1openalex-snapshot
Introduction to the Theory of Interior Point Methods
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-61257-2openalex-snapshot
Numerical Continuation Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-75639-9_99openalex-snapshot
Degeneracy Graphs — A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-77254-2_8openalex-snapshot
Degeneracy in Mathematical Programming and Degeneracy Graphs — A Concise Version of A Tutorial —
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/bf01585762openalex-snapshot
Resolving degeneracy in combinatorial linear programs: Steepest edge, steepest ascent, and parametric ascent
inferred← citeshttps://doi.org/10.1007/bf02023103openalex-snapshot
Encounters with degeneracy: A personal view
inferred← citeshttps://doi.org/10.1007/bf02096255openalex-snapshot
Selected bibliography on degeneracy
inferred← citeshttps://doi.org/10.1007/bf02096258openalex-snapshot
Degeneracy graphs: theory and application an updated survey
inferred← citeshttps://doi.org/10.1007/bf02096264openalex-snapshot
Pivot rules for linear programming: A survey on recent theoretical developments
inferred← citeshttps://doi.org/10.1016/0305-0548(93)90017-dopenalex-snapshot
A parametric programming methodology to solve the lagrangian dual for network problems with multiple side-constraints
inferred← citeshttps://doi.org/10.1016/0377-2217(91)90323-nopenalex-snapshot
Applications of the parametric programming procedure
inferred← citeshttps://doi.org/10.1016/j.cor.2005.02.001openalex-snapshot
Systematic construction of examples for cycling in the simplex method
inferred← citeshttps://doi.org/10.1023/a:1008651227485openalex-snapshot
Nondegeneracy of Polyhedra and Linear Programs
inferred← citeshttps://doi.org/10.1080/02331939508844049openalex-snapshot
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
inferred← citeshttps://doi.org/10.1198/jcgs.2010.08115openalex-snapshot
Solvingℓ1Regularization Problems With Piecewise Linear Losses
inferred← citeshttps://doi.org/10.1287/opre.2013.1164openalex-snapshot
Optimal Sequential Exploration: Bandits, Clairvoyants, and Wildcats
inferred← citeshttps://doi.org/10.5251/ajsir.2012.3.4.226.230openalex-snapshot
Computation of soap production using a developed parametric linear programming algorithm
inferred← citeshttps://doi.org/10.5784/6-1-478openalex-snapshot
Degeneracy problems in mathematical programming and degeneracy graphs
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.