Gigaflops in linear programming
From MaRDI portal
Publication:1919182
DOI10.1016/0167-6377(96)83270-6zbMath0855.90083OpenAlexW2012464173WikidataQ60140224 ScholiaQ60140224MaRDI QIDQ1919182
Edward Rothberg, Irvin J. Lustig
Publication date: 3 February 1997
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(96)83270-6
Related Items (4)
Detecting ``dense columns in interior point methods for linear programs ⋮ Unnamed Item ⋮ Symbiosis between linear algebra and optimization ⋮ Advances in design and implementation of optimization software
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Feasibility issues in a primal-dual interior-point method for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- An analysis of an available set of linear programming test problems
- An implementation of a parallel primal-dual interior point method for block- structured linear programs
- A parallel interior point algorithm for linear programming on a network of transputers
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Implementing the Simplex Method: The Initial Basis
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- The influence of relaxed supernode partitions on the multifrontal method
- An Approximate Minimum Degree Ordering Algorithm
- Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers
This page was built for publication: Gigaflops in linear programming
