The gravitational method for linear programming
From MaRDI portal
Publication:1821685
zbMath0616.90039MaRDI QIDQ1821685
Publication date: 1986
Published in: Opsearch (Search for Journal in Brave)
Related Items
A regularized simplex method, A gravitational interior point method for LP., A computational study of redundancy in randomly generated polytopes, Complexity of the gravitational method for linear programming, The steepest descent gravitational method for linear programming, Pivot rules for linear programming: A survey on recent theoretical developments