scientific article; zbMATH DE number 3115468
From MaRDI portal
Publication:3229788
Cited in
(14)- A new pivoting rule for solving various degeneracy problems
- On some properties of \(0\)-degeneracy graphs
- An exterior point simplex algorithm for (general) linear programming problems
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
- Pivot versus interior point methods: Pros and cons
- A phase-1 approach for the generalized simplex algorithm
- Cycling in linear programming problems
- A basis-defiency-allowing variation of the simplex method for linear programming
- Some NP-complete problems in linear programming
- Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era
- Systematic construction of examples for cycling in the simplex method
- Discrete Tchebycheff approximation for multivariate splines
- Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era
- Open problems in computational linear algebra
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3229788)
