scientific article; zbMATH DE number 913271
From MaRDI portal
Recommendations
- A new polynomial-time algorithm for linear programming
- Polynomial affine algorithms for linear programming
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- Convergence results and numerical experiments on a linear programming hybrid algorithm
Cited in
(10)- Convergence results and numerical experiments on a linear programming hybrid algorithm
- A combined phase I-phase II scaled potential algorithm for linear programming
- On the convergence rate of the duality gap in a symmetric primal-dual potential reduction algorithm
- A hybrid method for linear programming
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3978821 (Why is no real title available?)
- scientific article; zbMATH DE number 4119927 (Why is no real title available?)
- scientific article; zbMATH DE number 7551027 (Why is no real title available?)
- A long-step, cutting plane algorithm for linear and convex programming
- An efficient linearization technique for mixed 0-1 polynomial problem
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 Q4887688)
