Pages that link to "Item:Q4025910"
From MaRDI portal
The following pages link to Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases (Q4025910):
Displaying 27 items.
- Interior point methods 25 years later (Q439546) (← links)
- Mixed integer programming: A historical perspective with Xpress-MP (Q537574) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- The double pivot simplex method (Q684156) (← links)
- Towards a practical parallelisation of the simplex method (Q970132) (← links)
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
- The augmented system variant of IPMs in two-stage stochastic linear programming computation (Q1278963) (← links)
- On the use of dense matrix techniques within sparse simplex (Q1309853) (← links)
- A fast LU update for linear programming (Q1309856) (← links)
- MOPS -- Mathematical optimization system (Q1317161) (← links)
- Recovering an optimal LP basis from an interior point solution (Q1342078) (← links)
- Supernode processing of mixed-integer models (Q1342883) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- Steepest-edge simplex algorithms for linear programming (Q1802952) (← links)
- An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522) (← links)
- Maintaining LU factors of a general sparse matrix (Q1822448) (← links)
- Numerical aspects in developing LP softwares, LPAKO and LPABO (Q1872947) (← links)
- Split cuts from sparse disjunctions (Q2195684) (← links)
- Novel update techniques for the revised simplex method (Q2352418) (← links)
- Parallel distributed-memory simplex for large-scale stochastic LP problems (Q2393649) (← links)
- A primal deficient-basis simplex algorithm for linear programming (Q2479158) (← links)
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
- Computing in Operations Research Using Julia (Q3466770) (← links)
- Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos (Q3621498) (← links)
- Permutations in the Factorization of Simplex Bases (Q5139619) (← links)
- Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems (Q5270418) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
