\(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.

DOI10.1016/S0096-3003(99)00004-1zbMath1042.90029MaRDI QIDQ1569192

N. Delaunay

Publication date: 25 June 2000

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

90C05: Linear programming

90C59: Approximation methods and heuristics in mathematical programming

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Error-free matrix symmetrizers and equivalent symmetric matrices
• A new polynomial-time algorithm for linear programming
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic
• A polynomial-time algorithm, based on Newton's method, for linear programming
• A center of a polytope: An expository review and a parallel implementation
• On continuity of the Moore-Penrose and Drazin generalized inverses
• Solving linear programming problems exactly
• An inequality sorting algorithm for a class of linear programming problems
• A variation on Karmarkar’s algorithm for solving linear programming problems
• An extended set of FORTRAN basic linear algebra subprograms
• Optimal iterative schemes for computing the Moore-Penrose matrix inverse
• Rank-Augmented LU-Algorithm for Computing Generalized Matrix Inverses
• On the Continuity of the Generalized Inverse
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• The least squares problem and pseudo-inverses
• The Pseudoinverse of a Rectangular or Singular Matrix and Its Application to the Solution of Systems of Linear Equations