Pages that link to "Item:Q5942223"
From MaRDI portal
The following pages link to Complexity of the gravitational method for linear programming (Q5942223):
Displaying 4 items.
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- The gravitational method for linear programming (Q1821685) (← links)
- A new vector field method for eigen-decomposition of symmetric matrices (Q2474357) (← links)
- A gravitational interior point method for LP. (Q2476413) (← links)