scientific article; zbMATH DE number 653033
From MaRDI portal
Publication:4308908
Recommendations
- The complexity of the simplex method
- scientific article; zbMATH DE number 4027159
- On the complexity of optimization over the standard simplex
- The Efficiency of the Simplex Method: A Survey
- scientific article; zbMATH DE number 3188915
- Computational techniques of the simplex method
- scientific article; zbMATH DE number 1064581
- scientific article; zbMATH DE number 2208706
- scientific article; zbMATH DE number 3206575
Cited in
(21)- Topological obstructions for vertex numbers of Minkowski sums
- An overview on the simplex algorithm
- Zonotopes with large 2D-cuts
- The simplex method is not always well behaved
- The simplex method as a global optimizer: A C-programming perspective
- Computational techniques of the simplex method
- Sparse classification: a scalable discrete optimization perspective
- Random edge can be exponential on abstract cubes
- scientific article; zbMATH DE number 428033 (Why is no real title available?)
- scientific article; zbMATH DE number 3852781 (Why is no real title available?)
- scientific article; zbMATH DE number 4156195 (Why is no real title available?)
- The Efficiency of the Simplex Method: A Survey
- scientific article; zbMATH DE number 1041033 (Why is no real title available?)
- A Comparison of the Original and Revised Simplex Methods
- On Simplex Pivoting Rules and Complexity Theory
- Upper and lower bounds on the smoothed complexity of the simplex method
- Upper and lower bounds on the smoothed complexity of the simplex method
- On the number of degenerate simplex pivots
- The sagitta method for solving linear programs
- On the number of degenerate simplex pivots
- On the complexity of optimization over the standard simplex
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4308908)
