A space decomposition-based deterministic algorithm for solving linear optimization problems
From MaRDI portal
Publication:2306623
DOI10.3390/axioms8030092zbMath1432.90080OpenAlexW2965300330MaRDI QIDQ2306623
Publication date: 24 March 2020
Published in: Axioms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/axioms8030092
linear optimizationdeterministic linear optimization algorithmfeasible-space analysislinear space decomposition
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scaling linear optimization problems prior to application of the simplex method
- Exterior point simplex-type algorithms for linear and network optimization problems
- Clarkson's algorithm for violator spaces
- A new polynomial-time algorithm for linear programming
- An infeasible (exterior point) simplex algorithm for assignment problems
- A space decomposition-based deterministic algorithm for solving linear optimization problems
- An exterior-point method for linear programming problems
- A randomized polynomial-time simplex algorithm for linear programming
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
- Pivoting rules for the revised simplex algorithm
- A Monotonic Build-Up Simplex Algorithm for Linear Programming
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Improving a primal–dual simplex-type algorithm using interior point methods
- A Simplex Method for Function Minimization
- The complexity of linear programming
This page was built for publication: A space decomposition-based deterministic algorithm for solving linear optimization problems
