A largest-distance pivot rule for the simplex algorithm
From MaRDI portal
Publication:2463487
Recommendations
Cites work
- A practicable steepest-edge simplex algorithm
- Computational techniques of the simplex method
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3206575 (Why is no real title available?)
- New Finite Pivoting Rules for the Simplex Method
- Pivot selection methods of the Devex LP code
- Practical finite pivoting rules for the simplex method
- Steepest-edge simplex algorithms for linear programming
Cited in
(13)- A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- Book review of: P.-Q. Pan, Linear programming computation
- Reinforcement learning of simplex pivot rules: a proof of concept
- A fast simplex algorithm for linear programming
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- Three nearly scaling-invariant versions of an exterior point algorithm for linear programming
- scientific article; zbMATH DE number 3904322 (Why is no real title available?)
- scientific article; zbMATH DE number 1203292 (Why is no real title available?)
- scientific article; zbMATH DE number 1960976 (Why is no real title available?)
- Exterior point simplex-type algorithms for linear and network optimization problems
- Optimal pivot path of the simplex method for linear programming based on reinforcement learning
- Efficient nested pricing in the simplex algorithm
This page was built for publication: A largest-distance pivot rule for the simplex algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463487)