Hyper-sparsity in the revised simplex method and how to exploit it (Q2490370): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SoPlex / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Benchmarks for Optimization Software / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: KORBX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DEVEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NETGEN / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-005-4802-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2102812372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stabilization of the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix augmentation and partitioning in the updating of the basis inverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Real-World Linear Programs: A Decade and More of Progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Product Form for the Inverse in the Simplex Method / 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: Updated triangular factors of the basis to maintain sparsity in the product form simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Partial Pivoting in Time Proportional to Arithmetic Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot selection methods of the Devex LP code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivoting for Size and Sparsity in Linear Programming Inversion Routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4346087 / rank
 
Normal rank

Latest revision as of 12:42, 24 June 2024

scientific article
Language Label Description Also known as
English
Hyper-sparsity in the revised simplex method and how to exploit it
scientific article

    Statements

    Hyper-sparsity in the revised simplex method and how to exploit it (English)
    0 references
    0 references
    0 references
    2 May 2006
    0 references
    linear programming
    0 references
    revised simplex method
    0 references
    sparsity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers