The ellipsoid method and its implications
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3715292 (Why is no real title available?)
- scientific article; zbMATH DE number 3793401 (Why is no real title available?)
- scientific article; zbMATH DE number 3626518 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3248677 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- A bad network problem for the simplex method and other minimum cost flow algorithms
- Complexity of linear programming
- Dimensional Reduction Variant of the Ellipsoid Algorithm for Linear Programming Problems
- Khachiyan’s algorithm for linear programming
- Matroid intersection algorithms
- Modifications and implementation of the ellipsoid algorithm for linear programming
- On Khachian's algorithm and minimal ellipsoids
- On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid
- The Average number of pivot steps required by the Simplex-Method is polynomial
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The ellipsoid method and its consequences in combinatorial optimization
- The simplex algorithm with the pivot rule of maximizing criterion improvement
- Worst case behavior of the steepest edge simplex method
This page was built for publication: The ellipsoid method and its implications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1835842)