Pages that link to "Item:Q911455"
From MaRDI portal
The following pages link to An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (Q911455):
Displaying 10 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- An exterior point simplex algorithm for (general) linear programming problems (Q1312781) (← links)
- On extremal behaviors of Murty's least index method (Q1332313) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- Combinatorial redundancy detection (Q1657399) (← links)
- An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522) (← links)
- The role of pivoting in proving some fundamental theorems of linear algebra (Q2644727) (← links)
- Three nearly scaling-invariant versions of an exterior point algorithm for linear programming (Q3454862) (← links)
- A new proof for the criss-cross method for quadratic programming (Q4327956) (← links)
