A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3904322
- scientific article; zbMATH DE number 1960976
- Practical finite pivoting rules for the simplex method
- On the complexity of a pivot step of the revised simplex algorithm
- On anti-cycling pivoting rules for the simplex method
- Simplicial pivoting algorithms for a tractable class of integer programs
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
- scientific article; zbMATH DE number 14316
- A largest-distance pivot rule for the simplex algorithm
- The simplex algorithm with a new primal and dual pivot rule
Cites work
Cited in
(7)- scientific article; zbMATH DE number 4045475 (Why is no real title available?)
- Criss-cross methods: A fresh view on pivot algorithms
- On Simplex Pivoting Rules and Complexity Theory
- scientific article; zbMATH DE number 179276 (Why is no real title available?)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- Pivot rules for linear programming: A survey on recent theoretical developments
- An exterior point simplex algorithm for (general) linear programming problems
This page was built for publication: A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095028)