New Finite Pivoting Rules for the Simplex Method
From MaRDI portal
Publication:4196237
Cited in
(only showing first 100 items - show all)- Efficient nested pricing in the simplex algorithm
- A note on degeneracy in linear programming
- A phase-1 approach for the generalized simplex algorithm
- A degeneracy exploiting LU factorization for the simplex method
- A largest-distance pivot rule for the simplex algorithm
- A new pivoting rule for solving various degeneracy problems
- Pivot versus interior point methods: Pros and cons
- Exterior point simplex-type algorithms for linear and network optimization problems
- Practical finite pivoting rules for the simplex method
- A dual approach to primal degeneracy
- Canonical bases in linear programming
- Some generalizations of the criss-cross method for quadratic programming
- A practical anti-cycling procedure for linearly constrained optimization
- A primal deficient-basis simplex algorithm for linear programming
- The basis suppression method
- A note on the continuity of solutions of parametric linear programs
- Customizing the solution process of COIN-OR's linear solvers with python
- New variants of finite criss-cross pivot algorithms for linear programming
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Criss-cross methods: A fresh view on pivot algorithms
- The role of pivoting in proving some fundamental theorems of linear algebra
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- scientific article; zbMATH DE number 13594 (Why is no real title available?)
- The pivot and probe algorithm for solving a linear program
- Primal transportation and transshipment algorithms
- An exterior simplex type algorithm for the minimum cost network flow problem
- Affirmative action algorithms
- A finite crisscross method for oriented matroids
- Quantifier elimination in automatic loop parallelization
- Degeneracy in linear complementarity problems: A survey
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- Modeling the satellite placement problem as a network flow problem with one side constraint
- Dealing with degeneracy in reduced gradient algorithms
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
- Subspaces with well-scaled frames
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming
- Degeneracy in the presence of roundoff errors
- A convergent criss-cross method
- A primal-dual simplex method for linear programs
- Measuring inconsistency
- On the solution of highly degenerate linear programmes
- Pivot rules for linear programming: A survey on recent theoretical developments
- Selected bibliography on degeneracy
- A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
- The double pivot simplex method
- Degeneracy graphs: Theory and applications. An updated survey
- Advances in design and implementation of optimization software
- A basis-defiency-allowing variation of the simplex method for linear programming
- Bi-objective multistage stochastic linear programming
- A Z-simplex algorithm with partial updates
- An experimental investigation of enumerative methods for the linear complementarity problem
- On the simplex algorithm initializing
- Linear and combinatorial sharing problems
- Least-index resolution of degeneracy in quadratic programming
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
- An exterior point simplex algorithm for (general) linear programming problems
- A combinatorial abstraction of linear programming
- Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
- The discrete moment problem and linear programming
- Survey of solved and open problems in the degeneracy phenomenon
- Unimodular modules
- A sequential LCP method for bilevel linear programming
- A simple direct cosine simplex algorithm
- Degeneracy resolution for bilinear utility functions
- Equivalence of some quadratic programming algorithms
- Primal and dual active-set methods for convex quadratic programming
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- A new version of the improved primal simplex for degenerate linear programs
- A linear programming decomposition focusing on the span of the nondegenerate columns
- Resolution of the problem of degeneracy in a primal and dual simplex algorithm
- The Stable Evaluation of Multivariate Simplex Splines
- An affine-scaling pivot algorithm for linear programming
- On the structure of the set bases of a degenerate point
- Edges versus circuits: a hierarchy of diameters in polyhedra
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- A new proof for the criss-cross method for quadratic programming
- Variants of the Hungarian method for solving linear programming problems
- Improving a primal–dual simplex-type algorithm using interior point methods
- A simplex-like method with bisection for linear programming1
- The positive edge criterion within COIN-OR's CLP
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
- A divide-and-conquer algorithm for binary matrix completion
- Standard forms for rational linear arithmetic in constraint logic programming.
- Pivoting rules and redundancy schemes in extreme point enumeration
- On some properties of \(0\)-degeneracy graphs
- A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming
- Modification and implementation of two-phase simplex method
- Linear max-min programming
- On anti-cycling pivoting rules for the simplex method
- Combinatorial optimization: the interplay of graph theory, linear and integer programming illustrated on network flow
- Inapproximability of shortest paths on perfect matching polytopes
- Finiteness of Criss-Cross Method in Complementarity Problem
- A quadratic simplex algorithm for primal optimization over zero-one polytopes
- Combinatoric classes of the transportation problem and their properties
- Encounters with degeneracy: A personal view
- Solution procedures for multi-objective markov decision processes
- Multi-parametric solution-path algorithm for instance-weighted support vector machines
- A hybrid algorithm for solving convex separable network flow problems
- Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
- An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
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)