New Finite Pivoting Rules for the Simplex Method

Cited In (only showing first 100 items - show all)

Least-index resolution of degeneracy in quadratic programming
A new proof for the criss-cross method for quadratic programming
A note on the continuity of solutions of parametric linear programs
The double pivot simplex method
A combinatorial abstraction of linear programming
Canonical bases in linear programming
A finite crisscross method for oriented matroids
Modeling the satellite placement problem as a network flow problem with one side constraint
A largest-distance pivot rule for the simplex algorithm
Degeneracy in the presence of roundoff errors
Bi-objective multistage stochastic linear programming
Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
Variants of the Hungarian method for solving linear programming problems
Criss-cross methods: A fresh view on pivot algorithms
A degeneracy exploiting LU factorization for the simplex method
An experimental investigation of enumerative methods for the linear complementarity problem
The role of pivoting in proving some fundamental theorems of linear algebra
The discrete moment problem and linear programming
A simplex-like method with bisection for linear programming¹
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
A sequential LCP method for bilevel linear programming
Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
Efficient nested pricing in the simplex algorithm
Measuring inconsistency
Degeneracy resolution for bilinear utility functions
A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
Subspaces with well-scaled frames
A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
An affine-scaling pivot algorithm for linear programming
Linear and combinatorial sharing problems
Primal and dual active-set methods for convex quadratic programming
A linear programming decomposition focusing on the span of the nondegenerate columns
Improving a primal–dual simplex-type algorithm using interior point methods
The positive edge criterion within COIN-OR's CLP
A note on degeneracy in linear programming
Degeneracy graphs: Theory and applications. An updated survey
Exterior point simplex-type algorithms for linear and network optimization problems
A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
Some generalizations of the criss-cross method for quadratic programming
Primal transportation and transshipment algorithms
A new version of the improved primal simplex for degenerate linear programs
Quantifier elimination in automatic loop parallelization
The pivot and probe algorithm for solving a linear program
Multi-phase dynamic constraint aggregation for set partitioning type problems
Pivot rules for linear programming: A survey on recent theoretical developments
Practical finite pivoting rules for the simplex method
Survey of solved and open problems in the degeneracy phenomenon
The Stable Evaluation of Multivariate Simplex Splines
A practical anti-cycling procedure for linearly constrained optimization
A convergent criss-cross method
Selected bibliography on degeneracy
A phase-1 approach for the generalized simplex algorithm
A Z-simplex algorithm with partial updates
A dual approach to primal degeneracy
The basis suppression method
A basis-defiency-allowing variation of the simplex method for linear programming
Advances in design and implementation of optimization software
Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
The \(s\)-monotone index selection rules for pivot algorithms of linear programming
A primal-dual simplex method for linear programs
Edges versus circuits: a hierarchy of diameters in polyhedra
Dealing with degeneracy in reduced gradient algorithms
Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
On the solution of highly degenerate linear programmes
On the structure of the set bases of a degenerate point
An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
A new pivoting rule for solving various degeneracy problems
An exterior simplex type algorithm for the minimum cost network flow problem
Unimodular modules
Affirmative action algorithms
Customizing the solution process of COIN-OR's linear solvers with python
On the simplex algorithm initializing
An exterior point simplex algorithm for (general) linear programming problems
Equivalence of some quadratic programming algorithms
A primal deficient-basis simplex algorithm for linear programming
Degeneracy in linear complementarity problems: A survey
Resolution of the problem of degeneracy in a primal and dual simplex algorithm
Pivot versus interior point methods: Pros and cons
New variants of finite criss-cross pivot algorithms for linear programming
Title not available (Why is that?)
A simple direct cosine simplex algorithm
Title not available (Why is that?)
Structure on the top homology and related algorithms
A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
Optimal pivot path of the simplex method for linear programming based on reinforcement learning
On anti-cycling pivoting rules for the simplex method
A hybrid algorithm for solving convex separable network flow problems
Parametric linear programming and anti-cycling pivoting rules
On the number of solutions generated by the simplex method for LP
Making progress during a stall in the simplex algorithm
On some properties of \(0\)-degeneracy graphs
Modification and implementation of two-phase simplex method
The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption
Multiparametric demand transportation problem
Tight approximation algorithms for geometric bin packing with skewed items
Combinatorial optimization: the interplay of graph theory, linear and integer programming illustrated on network flow
An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
Linear max-min programming
Combinatoric classes of the transportation problem and their properties
Encounters with degeneracy: A personal view

This page was built for publication: New Finite Pivoting Rules for the Simplex Method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4196237)