scientific article; zbMATH DE number 3354790
From MaRDI portal
zbMath0223.90001MaRDI QIDQ5629405
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Affirmative action algorithms, The positive edge criterion within COIN-OR's CLP, Heights of convex polytopes, A class of linear programming problems requiring a large number of iterations, On the number of iterations of local improvement algorithms, Reinversion with the preassigned pivot procedure, On the solution of linear equation/inequality systems, Experiments with external pivoting, Pivot selection methods of the Devex LP code, Some Results on Sparse Matrices, A computational study of redundancy in randomly generated polytopes, Complexity of the gravitational method for linear programming, Steepest-edge rule and its number of simplex iterations for a nondegenerate LP, A practicable steepest-edge simplex algorithm, Steepest-edge simplex algorithms for linear programming, Gaining traction: on the convergence of an inner approximation scheme for probability maximization, An efficient simplex type algorithm for sparse and dense linear programs., Low order polynomial bounds on the expected performance of local improvement algorithms, Reinforcement learning of simplex pivot rules: a proof of concept, Solving staircase linear programs by the simplex method, 2: Pricing, Nonadjacent extreme point methods for solving linear programs, Adjacent vertex simplex algorithms: More experimental results on random problems
