scientific article; zbMATH DE number 3614492
From MaRDI portal
Publication:4178772
zbMath0395.90046MaRDI QIDQ4178772
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)
Related Items
A phase-1 approach for the generalized simplex algorithm, A dual approach to primal degeneracy, On the solution of highly degenerate linear programmes, The positive edge criterion within COIN-OR's CLP, Customizing the solution process of COIN-OR's linear solvers with python, Improving a primal–dual simplex-type algorithm using interior point methods, A computational approach to pivot selection in the LP relaxation of set problems, A primal deficient-basis simplex algorithm for linear programming, Complexity of the gravitational method for linear programming, The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results, A basis-defiency-allowing variation of the simplex method for linear programming, Numerical behavior of LP algorithms based upon the decomposition principle, An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming, Nonadjacent extreme point methods for solving linear programs
