The following pages link to (Q3229788):
Displaying 14 items.
- Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era (Q928099) (← links)
- Open problems in computational linear algebra (Q999481) (← links)
- A new pivoting rule for solving various degeneracy problems (Q1198621) (← links)
- On some properties of \(0\)-degeneracy graphs (Q1312774) (← links)
- An exterior point simplex algorithm for (general) linear programming problems (Q1312781) (← links)
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation. (Q1569192) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
- Cycling in linear programming problems (Q1765542) (← links)
- A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
- Some NP-complete problems in linear programming (Q1837108) (← links)
- Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era (Q2390176) (← links)
- Systematic construction of examples for cycling in the simplex method (Q2489285) (← links)
- Discrete Tchebycheff approximation for multivariate splines (Q2554850) (← links)
