New Finite Pivoting Rules for the Simplex Method

Cited in

(only showing first 100 items - show all)

An exterior simplex type algorithm for the minimum cost network flow problem
Solving Linear Programming Problems by Reducing to the Form with an Obvious Answer
Unimodular modules
Standard forms for rational linear arithmetic in constraint logic programming.
Affirmative action algorithms
Circuit walks in integral polyhedra
Customizing the solution process of COIN-OR's linear solvers with python
An exterior point simplex algorithm for (general) linear programming problems
On the simplex algorithm initializing
Equivalence of some quadratic programming algorithms
Degeneracy in linear complementarity problems: A survey
On finding and detecting efficient assignments in the case of multiple inputs and outputs
A primal deficient-basis simplex algorithm for linear programming
Resolution of the problem of degeneracy in a primal and dual simplex algorithm
scientific article; zbMATH DE number 13594 (Why is no real title available?)
Courtship and linear programming
Pivot versus interior point methods: Pros and cons
New variants of finite criss-cross pivot algorithms for linear programming
A simple direct cosine simplex algorithm
A note on the continuity of solutions of parametric linear programs
Least-index resolution of degeneracy in quadratic programming
The double pivot simplex method
A new proof for the criss-cross method for quadratic programming
scientific article; zbMATH DE number 7559118 (Why is no real title available?)
Structure on the top homology and related algorithms
A combinatorial abstraction of linear programming
A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
Canonical bases in linear programming
On anti-cycling pivoting rules for the simplex method
Modeling the satellite placement problem as a network flow problem with one side constraint
A finite crisscross method for oriented matroids
Optimal pivot path of the simplex method for linear programming based on reinforcement learning
A largest-distance pivot rule for the simplex algorithm
Degeneracy in the presence of roundoff errors
Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
Parametric linear programming and anti-cycling pivoting rules
Bi-objective multistage stochastic linear programming
A hybrid algorithm for solving convex separable network flow problems
Criss-cross methods: A fresh view on pivot algorithms
Variants of the Hungarian method for solving linear programming problems
On the number of solutions generated by the simplex method for LP
An experimental investigation of enumerative methods for the linear complementarity problem
A degeneracy exploiting LU factorization for the simplex method
Making progress during a stall in the simplex algorithm
The discrete moment problem and linear programming
The role of pivoting in proving some fundamental theorems of linear algebra
A simplex-like method with bisection for linear programming¹
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
On some properties of \(0\)-degeneracy graphs
A sequential LCP method for bilevel linear programming
Efficient nested pricing in the simplex algorithm
Measuring inconsistency
Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
Modification and implementation of two-phase simplex method
Degeneracy resolution for bilinear utility functions
The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption
Multiparametric demand transportation problem
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\)
Tight approximation algorithms for geometric bin packing with skewed items
An affine-scaling pivot algorithm for linear programming
Primal and dual active-set methods for convex quadratic programming
A linear programming decomposition focusing on the span of the nondegenerate columns
Linear and combinatorial sharing problems
The positive edge criterion within COIN-OR's CLP
Improving a primal–dual simplex-type algorithm using interior point methods
A note on degeneracy in linear programming
An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
Degeneracy graphs: Theory and applications. An updated survey
Exterior point simplex-type algorithms for linear and network optimization problems
Combinatorial optimization: the interplay of graph theory, linear and integer programming illustrated on network flow
A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
Linear max-min programming
Combinatoric classes of the transportation problem and their properties
Encounters with degeneracy: A personal view
A new version of the improved primal simplex for degenerate linear programs
Some generalizations of the criss-cross method for quadratic programming
Primal transportation and transshipment algorithms
Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
Quantifier elimination in automatic loop parallelization
Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function
A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming
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
The pivot and probe algorithm for solving a linear program
Survey of solved and open problems in the degeneracy phenomenon
Solution procedures for multi-objective markov decision processes
A practical anti-cycling procedure for linearly constrained optimization
A quadratic simplex algorithm for primal optimization over zero-one polytopes
The Stable Evaluation of Multivariate Simplex Splines
Selected bibliography on degeneracy
A convergent criss-cross method
A phase-1 approach for the generalized simplex algorithm
A Z-simplex algorithm with partial updates
Multi-parametric solution-path algorithm for instance-weighted support vector machines
A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties
The basis suppression method

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)