- Algebra
- >
- Linear algebra
- >
- Numerical linear algebra
- >
- Exchange algorithms

- Algorithms
- >
- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Exchange algorithms

- Algorithms
- >
- Numerical analysis
- >
- Numerical linear algebra
- >
- Exchange algorithms

- Algorithms
- >
- Search algorithms
- >
- Combinatorial optimization
- >
- Exchange algorithms

- Applied mathematics
- >
- Algorithms
- >
- Combinatorial algorithms
- >
- Exchange algorithms

- Applied mathematics
- >
- Algorithms
- >
- Optimization algorithms and methods
- >
- Exchange algorithms

- Applied mathematics
- >
- Computational mathematics
- >
- Combinatorial algorithms
- >
- Exchange algorithms

- Approximations
- >
- Numerical analysis
- >
- Numerical linear algebra
- >
- Exchange algorithms

- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Matroid theory
- >
- Exchange algorithms

- Combinatorics
- >
- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Exchange algorithms

- Computational mathematics
- >
- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Exchange algorithms

- Computational mathematics
- >
- Numerical analysis
- >
- Numerical linear algebra
- >
- Exchange algorithms

- Discrete mathematics
- >
- Combinatorics
- >
- Combinatorial algorithms
- >
- Exchange algorithms

- Discrete mathematics
- >
- Combinatorics
- >
- Matroid theory
- >
- Exchange algorithms

- Discrete mathematics
- >
- Discrete geometry
- >
- Matroid theory
- >
- Exchange algorithms

- Duality theories
- >
- Closure operators
- >
- Matroid theory
- >
- Exchange algorithms

- Fields of geometry
- >
- Discrete geometry
- >
- Matroid theory
- >
- Exchange algorithms

- Fields of mathematical analysis
- >
- Numerical analysis
- >
- Numerical linear algebra
- >
- Exchange algorithms

- Fields of mathematics
- >
- Combinatorics
- >
- Combinatorial algorithms
- >
- Exchange algorithms

- Fields of mathematics
- >
- Combinatorics
- >
- Matroid theory
- >
- Exchange algorithms

- Fields of mathematics
- >
- Computational mathematics
- >
- Combinatorial algorithms
- >
- Exchange algorithms

- General topology
- >
- Closure operators
- >
- Matroid theory
- >
- Exchange algorithms

- Graph theory
- >
- Network theory
- >
- Combinatorial optimization
- >
- Exchange algorithms

- Mathematical analysis
- >
- Mathematical optimization
- >
- Combinatorial optimization
- >
- Exchange algorithms

- Mathematical analysis
- >
- Mathematical optimization
- >
- Optimization algorithms and methods
- >
- Exchange algorithms

- Mathematical logic
- >
- Algorithms
- >
- Combinatorial algorithms
- >
- Exchange algorithms

- Mathematical logic
- >
- Algorithms
- >
- Optimization algorithms and methods
- >
- Exchange algorithms

- Mathematical optimization
- >
- Combinatorial optimization
- >
- Matroid theory
- >
- Exchange algorithms

- Mathematics of computing
- >
- Numerical analysis
- >
- Numerical linear algebra
- >
- Exchange algorithms

- Network theory
- >
- Combinatorial optimization
- >
- Matroid theory
- >
- Exchange algorithms

- Numerical analysis
- >
- Iterative methods
- >
- Optimization algorithms and methods
- >
- Exchange algorithms

- Numerical analysis
- >
- Mathematical optimization
- >
- Combinatorial optimization
- >
- Exchange algorithms

- Numerical analysis
- >
- Mathematical optimization
- >
- Optimization algorithms and methods
- >
- Exchange algorithms

- Operations research
- >
- Network theory
- >
- Combinatorial optimization
- >
- Exchange algorithms

- Order theory
- >
- Closure operators
- >
- Matroid theory
- >
- Exchange algorithms

- Search algorithms
- >
- Combinatorial optimization
- >
- Matroid theory
- >
- Exchange algorithms

- Theoretical computer science
- >
- Algorithms
- >
- Combinatorial algorithms
- >
- Exchange algorithms

- Theoretical computer science
- >
- Algorithms
- >
- Optimization algorithms and methods
- >
- Exchange algorithms

Pivot element

The pivot or pivot element is the element of a matrix, or an array, which is selected first by an algorithm (e.g. Gaussian elimination, simplex algorithm, etc.), to do certain calculations. In the cas

Revised simplex method

In mathematical optimization, the revised simplex method is a variant of George Dantzig's simplex method for linear programming. The revised simplex method is mathematically equivalent to the standard

Gaussian elimination

In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matri

Zadeh's rule

In mathematical optimization, Zadeh's rule (also known as the least-entered rule) is an algorithmic refinement of the simplex method for linear optimization. The rule was proposed around 1980 by Norma

Greedy algorithm

A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. In many problems, a greedy strategy does not produce an optimal solut

Criss-cross algorithm

In mathematical optimization, the criss-cross algorithm is any of a family of algorithms for linear programming. Variants of the criss-cross algorithm also solve more general problems with linear ineq

Bareiss algorithm

In mathematics, the Bareiss algorithm, named after , is an algorithm to calculate the determinant or the echelon form of a matrix with integer entries using only integer arithmetic; any divisions that

Bland's rule

In mathematical optimization, Bland's rule (also known as Bland's algorithm, Bland's anti-cycling rule or Bland's pivot rule) is an algorithmic refinement of the simplex method for linear optimization

Cunningham's rule

In mathematical optimization, Cunningham's rule (also known as least recently considered rule or round-robin rule) is an algorithmic refinement of the simplex method for linear optimization. The rule

Simplex algorithm

In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is a popular algorithm for linear programming. The name of the algorithm is derived from the concept of a simplex and was

© 2023 Useful Links.