Pages that link to "Item:Q1821685"
From MaRDI portal
The following pages link to The gravitational method for linear programming (Q1821685):
Displaying 9 items.
- A regularized simplex method (Q302140) (← links)
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- The bounce algorithm for mathematical programming (Q1397681) (← links)
- A gravitational interior point method for LP. (Q2476413) (← links)
- Gravity training method (Q2993035) (← links)
- Complexity of the gravitational method for linear programming (Q5942223) (← links)
- Complexity of the gravitational method for linear programming (Q6567772) (← links)