A triangulation and fill-reducing initialization procedure for the simplex algorithm
From MaRDI portal
Publication:2062318
DOI10.1007/s12532-020-00188-1zbMath1477.90038OpenAlexW3037731493MaRDI QIDQ2062318
Nikolaos V. Sahinidis, Nikolaos Ploskas, Nikolaos Samaras
Publication date: 27 December 2021
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-020-00188-1
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic simplex initialization combined with the nonfeasible basis method
- Scaling linear optimization problems prior to application of the simplex method
- New crash procedures for large systems of linear constraints
- Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods
- An overview on the simplex algorithm
- Eliminating columns in the simplex method for linear programming
- Pivot rules for linear programming: A survey on recent theoretical developments
- Advanced preprocessing techniques for linear and quadratic programming
- Parallelizing the dual revised simplex method
- Steepest-edge simplex algorithms for linear programming
- Computational techniques of the simplex method
- Preprocessing for quadratic programming
- Presolving in linear programming
- An improved initial basis for the simplex algorithm
- The Elimination form of the Inverse and its Application to Linear Programming
- Linear Programming Computation
- Pivoting rules for the revised simplex algorithm
- Algorithm 915, SuiteSparseQR
- A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
- Computing the Minimum Fill-In is NP-Complete
- Sparse Matrices in MATLAB: Design and Implementation
- Implementing the Simplex Method: The Initial Basis
- On the Bartels—Golub decomposition for linear programming bases
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
- An Approximate Minimum Degree Ordering Algorithm
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit
- A column approximate minimum degree ordering algorithm
- Algorithm 836
- On the Automatic Scaling of Matrices for Gaussian Elimination
- Pivot selection methods of the Devex LP code
- Programming of Interdependent Activities: II Mathematical Model
- An efficient search direction for linear programming problems
- Benchmarking optimization software with performance profiles.
- Creating advanced bases for large scale linear programs exploiting embedded network structure
This page was built for publication: A triangulation and fill-reducing initialization procedure for the simplex algorithm
