A Short-Cut Potential Reduction Algorithm for Linear Programming
From MaRDI portal
Recommendations
Cited in
(11)- Identifying an optimal basis in linear programming
- A Potential Reduction Algorithm Allowing Column Generation
- A potential-reduction algorithm for linear complementarity problems
- A logarithmic barrier cutting plane method for convex programming
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- scientific article; zbMATH DE number 1866915 (Why is no real title available?)
- A primal-dual interior point method whose running time depends only on the constraint matrix
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- scientific article; zbMATH DE number 1444279 (Why is no real title available?)
This page was built for publication: A Short-Cut Potential Reduction Algorithm for Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4274639)