An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Matlab / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: symrcm / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monotonic Build-Up Simplex Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4188659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commentary—Progress in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of optimization algorithms - some aspects from a practical point of view / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex algorithm with a new primal and dual pivot rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution of the problem of degeneracy in a primal and dual simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steepest-edge simplex algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Matrices in MATLAB: Design and Implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Matrix Methods in Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case behavior of the steepest edge simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exterior point simplex algorithm for (general) linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible (exterior point) simplex algorithm for assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential example for Terlaky's pivoting rule for the criss-cross simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Schur Complement Techniques for General Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5564917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629405 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(02)00400-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094456378 / rank
 
Normal rank

Latest revision as of 08:32, 30 July 2024

scientific article
Language Label Description Also known as
English
An efficient simplex type algorithm for sparse and dense linear programs.
scientific article

    Statements

    An efficient simplex type algorithm for sparse and dense linear programs. (English)
    0 references
    0 references
    0 references
    9 June 2003
    0 references
    Linear programming
    0 references
    Simplex type algorithms
    0 references
    Big-\(M\) method
    0 references
    Algorithm
    0 references
    evaluation
    0 references
    Numerical experiments
    0 references
    0 references
    0 references

    Identifiers